Base | Representation |
---|---|
bin | 100100001100110… |
… | …0111010000001101 |
3 | 10010122121211101110 |
4 | 1020121213100031 |
5 | 4441424031213 |
6 | 320310402233 |
7 | 42046362264 |
oct | 11031472015 |
9 | 3118554343 |
10 | 1214673933 |
11 | 573719560 |
12 | 29a960379 |
13 | 164861595 |
14 | b746d5db |
15 | 719885c3 |
hex | 4866740d |
1214673933 has 32 divisors (see below), whose sum is σ = 1903080960. Its totient is φ = 681186240.
The previous prime is 1214673931. The next prime is 1214673947. The reversal of 1214673933 is 3393764121.
It is not a de Polignac number, because 1214673933 - 21 = 1214673931 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 1214673891 and 1214673900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1214673931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4435 + ... + 49487.
It is an arithmetic number, because the mean of its divisors is an integer number (59471280).
Almost surely, 21214673933 is an apocalyptic number.
It is an amenable number.
1214673933 is a deficient number, since it is larger than the sum of its proper divisors (688407027).
1214673933 is a wasteful number, since it uses less digits than its factorization.
1214673933 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45129.
The product of its digits is 81648, while the sum is 39.
The square root of 1214673933 is about 34852.1725721654. The cubic root of 1214673933 is about 1066.9725272076.
The spelling of 1214673933 in words is "one billion, two hundred fourteen million, six hundred seventy-three thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •