114
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 240
- Proper Divisor Sum (Aliquot Sum)
- 126
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 36
- Möbius Function
- -1
- Radical
- 114
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 33
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- einshundertvierzehn· ordinal: einshundertvierzehnste
- English
- one hundred fourteen· ordinal: one hundred fourteenth
- Spanish
- ciento catorce· ordinal: 114º
- French
- cent quatorze· ordinal: cent quatorzième
- Italian
- centoquattordici· ordinal: 114º
- Latin
- centum quattuordecim· ordinal: 114.
- Portuguese
- cento e catorze· ordinal: 114º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=32A000008
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=56A000028
- Numbers k such that (2k)^4 + 1 is prime.at n=32A000059
- Number of partitions of n if there are two kinds of 1's and two kinds of 2's.at n=8A000097
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=13A000123
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=45A000277
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=47A000419
- n written in base where place values are positive cubes.at n=39A000433
- 1 together with products of 2 or more distinct primes.at n=41A000469
- Numbers beginning with a vowel in English.at n=28A000852
- Numbers beginning with letter 'o' in English.at n=15A000865
- Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=23A000931
- Numbers that are divisible by at least three different primes.at n=11A000977
- Moran numbers: k such that k/(sum of digits of k) is prime.at n=8A001101
- Smallest even number that is an unordered sum of two odd primes in exactly n ways.at n=10A001172
- Continued fraction for e^2.at n=45A001204
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=5A001209
- a(n) = solution to the postage stamp problem with n denominations and 6 stamps.at n=3A001216
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=32A001312
- Number of ways of making change for n cents using coins of 1, 2, 4, 12, 24, 48, 96, 120 cents (based on English coinage of 1939).at n=30A001364