Base | Representation |
---|---|
bin | 100100001100101… |
… | …1011111100010001 |
3 | 10010122112110211110 |
4 | 1020121123330101 |
5 | 4441421040401 |
6 | 320305403533 |
7 | 42046110225 |
oct | 11031337421 |
9 | 3118473743 |
10 | 1214627601 |
11 | 573697770 |
12 | 29a9395a9 |
13 | 164846475 |
14 | b745a785 |
15 | 719799d6 |
hex | 4865bf11 |
1214627601 has 32 divisors (see below), whose sum is σ = 1840167936. Its totient is φ = 706104000.
The previous prime is 1214627599. The next prime is 1214627633. The reversal of 1214627601 is 1067264121.
It is not a de Polignac number, because 1214627601 - 21 = 1214627599 is a prime.
It is a super-2 number, since 2×12146276012 = 2950640418222030402, which contains 22 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (1214627651) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79686 + ... + 93696.
It is an arithmetic number, because the mean of its divisors is an integer number (57505248).
Almost surely, 21214627601 is an apocalyptic number.
1214627601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1214627601 is a deficient number, since it is larger than the sum of its proper divisors (625540335).
1214627601 is a wasteful number, since it uses less digits than its factorization.
1214627601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14133.
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 1214627601 is about 34851.5078726875. The cubic root of 1214627601 is about 1066.9589609880.
The spelling of 1214627601 in words is "one billion, two hundred fourteen million, six hundred twenty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •