Base | Representation |
---|---|
bin | 1001010010011010101011… |
… | …1000100111110001101101 |
3 | 1100011020222010121010022010 |
4 | 2110212222320213301231 |
5 | 2314303141040413201 |
6 | 33415155135311433 |
7 | 2102535661523154 |
oct | 224465270476155 |
9 | 40136863533263 |
10 | 10212004232301 |
11 | 3287983187663 |
12 | 118b1a367b579 |
13 | 590cac461721 |
14 | 27439961059b |
15 | 12a9871c1bd6 |
hex | 949aae27c6d |
10212004232301 has 8 divisors (see below), whose sum is σ = 13616029696480. Its totient is φ = 6807990794832.
The previous prime is 10212004232249. The next prime is 10212004232303. The reversal of 10212004232301 is 10323240021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10212004232301 - 210 = 10212004231277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212004232303) 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 7 ways as a sum of consecutive naturals, for example, 792475 + ... + 4588248.
It is an arithmetic number, because the mean of its divisors is an integer number (1702003712060).
Almost surely, 210212004232301 is an apocalyptic number.
It is an amenable number.
10212004232301 is a deficient number, since it is larger than the sum of its proper divisors (3404025464179).
10212004232301 is an equidigital number, since it uses as much as digits as its factorization.
10212004232301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6013355.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10212004232301 its reverse (10323240021201), we get a palindrome (20535244253502).
The spelling of 10212004232301 in words is "ten trillion, two hundred twelve billion, four million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •