Base | Representation |
---|---|
bin | 10001110000001110010… |
… | …000110011111010001011 |
3 | 11022122001121001102122222 |
4 | 101300032100303322023 |
5 | 124442040030000021 |
6 | 2332244224204255 |
7 | 154066661616335 |
oct | 21601620637213 |
9 | 4278047042588 |
10 | 1220010000011 |
11 | 430448926290 |
12 | 178542a6968b |
13 | 8b07b0841ba |
14 | 43097c94455 |
15 | 21b0677e6ab |
hex | 11c0e433e8b |
1220010000011 has 8 divisors (see below), whose sum is σ = 1330931089200. Its totient is φ = 1109090759040.
The previous prime is 1220009999953. The next prime is 1220010000017. The reversal of 1220010000011 is 1100000100221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1220010000011 - 230 = 1218936258187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1220010000017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1168295 + ... + 1950623.
It is an arithmetic number, because the mean of its divisors is an integer number (166366386150).
Almost surely, 21220010000011 is an apocalyptic number.
1220010000011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1220010000011 is a deficient number, since it is larger than the sum of its proper divisors (110921089189).
1220010000011 is a wasteful number, since it uses less digits than its factorization.
1220010000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 924109.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1220010000011 its reverse (1100000100221), we get a palindrome (2320010100232).
The spelling of 1220010000011 in words is "one trillion, two hundred twenty billion, ten million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •