Base | Representation |
---|---|
bin | 1001010010011110011001… |
… | …0111101100001001100110 |
3 | 1100011100112200111210002120 |
4 | 2110213212113230021212 |
5 | 2314312212032414142 |
6 | 33415442150050410 |
7 | 2102602500424413 |
oct | 224474627541146 |
9 | 40140480453076 |
10 | 10213002232422 |
11 | 3288345564950 |
12 | 118b421949a06 |
13 | 59110b14b542 |
14 | 274451d9b10a |
15 | 12a9e4b0a7ec |
hex | 949e65ec266 |
10213002232422 has 64 divisors (see below), whose sum is σ = 22485259577088. Its totient is φ = 3066870800000.
The previous prime is 10213002232421. The next prime is 10213002232439. The reversal of 10213002232422 is 22423220031201.
10213002232422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10213002232392 and 10213002232401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213002232421) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1698772 + ... + 4828232.
It is an arithmetic number, because the mean of its divisors is an integer number (351332180892).
Almost surely, 210213002232422 is an apocalyptic number.
10213002232422 is an abundant number, since it is smaller than the sum of its proper divisors (12272257344666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213002232422 is a wasteful number, since it uses less digits than its factorization.
10213002232422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3129925.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 10213002232422 its reverse (22423220031201), we get a palindrome (32636222263623).
The spelling of 10213002232422 in words is "ten trillion, two hundred thirteen billion, two million, two hundred thirty-two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •