Base | Representation |
---|---|
bin | 110000011011100110100110… |
… | …110101101101111001010001 |
3 | 1000221011220021010022020100222 |
4 | 300123212212311231321101 |
5 | 210404320333211210001 |
6 | 2033004140123322425 |
7 | 62602652454406601 |
oct | 6033464665557121 |
9 | 1027156233266328 |
10 | 213003112210001 |
11 | 61962126954523 |
12 | 1ba8151b380415 |
13 | 91b1151958a79 |
14 | 3a85597100c01 |
15 | 1995a76a8261b |
hex | c1b9a6d6de51 |
213003112210001 has 8 divisors (see below), whose sum is σ = 215659649130240. Its totient is φ = 210348723727152.
The previous prime is 213003112209989. The next prime is 213003112210043. The reversal of 213003112210001 is 100012211300312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213003112210001 is a prime.
It is a super-2 number, since 2×2130031122100012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213003112216001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 536909825 + ... + 537306398.
It is an arithmetic number, because the mean of its divisors is an integer number (26957456141280).
Almost surely, 2213003112210001 is an apocalyptic number.
It is an amenable number.
213003112210001 is a deficient number, since it is larger than the sum of its proper divisors (2656536920239).
213003112210001 is a wasteful number, since it uses less digits than its factorization.
213003112210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1074218695.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 213003112210001 its reverse (100012211300312), we get a palindrome (313015323510313).
The spelling of 213003112210001 in words is "two hundred thirteen trillion, three billion, one hundred twelve million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •