Base | Representation |
---|---|
bin | 10001101001110011000… |
… | …111001100010111111011 |
3 | 11021222020212022220112210 |
4 | 101221303013030113323 |
5 | 124333423140334003 |
6 | 2325143533110203 |
7 | 153434022141450 |
oct | 21516307142773 |
9 | 4258225286483 |
10 | 1213112043003 |
11 | 428529139073 |
12 | 177138928363 |
13 | 8a51bc58933 |
14 | 42a01adb827 |
15 | 21850dc0503 |
hex | 11a731cc5fb |
1213112043003 has 32 divisors (see below), whose sum is σ = 1866568665600. Its totient is φ = 686455660800.
The previous prime is 1213112042999. The next prime is 1213112043007. The reversal of 1213112043003 is 3003402113121.
It is an interprime number because it is at equal distance from previous prime (1213112042999) and next prime (1213112043007).
It is not a de Polignac number, because 1213112043003 - 22 = 1213112042999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1213112043007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5621703 + ... + 5833503.
It is an arithmetic number, because the mean of its divisors is an integer number (58330270800).
Almost surely, 21213112043003 is an apocalyptic number.
1213112043003 is a deficient number, since it is larger than the sum of its proper divisors (653456622597).
1213112043003 is a wasteful number, since it uses less digits than its factorization.
1213112043003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214467.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1213112043003 its reverse (3003402113121), we get a palindrome (4216514156124).
The spelling of 1213112043003 in words is "one trillion, two hundred thirteen billion, one hundred twelve million, forty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •