Base | Representation |
---|---|
bin | 110000011011101111000101… |
… | …111001110100010001101001 |
3 | 1000221012202210002110020001020 |
4 | 300123233011321310101221 |
5 | 210404443013132004001 |
6 | 2033012244154043053 |
7 | 62603424316455240 |
oct | 6033570571642151 |
9 | 1027182702406036 |
10 | 213012223313001 |
11 | 61965a81930012 |
12 | 1ba83242719489 |
13 | 91b1c74439488 |
14 | 3a85bbd197957 |
15 | 1995e0b8a8736 |
hex | c1bbc5e74469 |
213012223313001 has 8 divisors (see below), whose sum is σ = 324590054572224. Its totient is φ = 121721270464560.
The previous prime is 213012223312949. The next prime is 213012223313077. The reversal of 213012223313001 is 100313322210312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213012223313001 - 210 = 213012223311977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (213012223353001) 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, 5071719602670 + ... + 5071719602711.
It is an arithmetic number, because the mean of its divisors is an integer number (40573756821528).
Almost surely, 2213012223313001 is an apocalyptic number.
213012223313001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
213012223313001 is a deficient number, since it is larger than the sum of its proper divisors (111577831259223).
213012223313001 is a wasteful number, since it uses less digits than its factorization.
213012223313001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10143439205391.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 213012223313001 its reverse (100313322210312), we get a palindrome (313325545523313).
The spelling of 213012223313001 in words is "two hundred thirteen trillion, twelve billion, two hundred twenty-three million, three hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •