Base | Representation |
---|---|
bin | 1001010011000011110000… |
… | …1000011010000001111011 |
3 | 1100012022102121102000120122 |
4 | 2110300330020122001323 |
5 | 2314443231414014321 |
6 | 33424221241243455 |
7 | 2103406144516400 |
oct | 224607410320173 |
9 | 40168377360518 |
10 | 10223031001211 |
11 | 3291621539316 |
12 | 119136049358b |
13 | 592048a9c462 |
14 | 274b23c8c2a7 |
15 | 12add029c8ab |
hex | 94c3c21a07b |
10223031001211 has 48 divisors (see below), whose sum is σ = 12202147137600. Its totient is φ = 8537205600000.
The previous prime is 10223031001207. The next prime is 10223031001213. The reversal of 10223031001211 is 11210013032201.
It is not a de Polignac number, because 10223031001211 - 22 = 10223031001207 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10223031001211.
It is not an unprimeable number, because it can be changed into a prime (10223031001213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 157484861 + ... + 157549761.
It is an arithmetic number, because the mean of its divisors is an integer number (254211398700).
Almost surely, 210223031001211 is an apocalyptic number.
10223031001211 is a deficient number, since it is larger than the sum of its proper divisors (1979116136389).
10223031001211 is a wasteful number, since it uses less digits than its factorization.
10223031001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65476 (or 65469 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10223031001211 its reverse (11210013032201), we get a palindrome (21433044033412).
The spelling of 10223031001211 in words is "ten trillion, two hundred twenty-three billion, thirty-one million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •