Base | Representation |
---|---|
bin | 101111111110111010001001… |
… | …100000111011011010101000 |
3 | 1000200012101111021110220121200 |
4 | 233332322021200323122220 |
5 | 210130013424414412412 |
6 | 2024454224145204200 |
7 | 62310334420221654 |
oct | 5776721140733250 |
9 | 1020171437426550 |
10 | 211031230232232 |
11 | 61271929990a43 |
12 | 1b803324030660 |
13 | 909a20c8c6097 |
14 | 3a17d74b63a64 |
15 | 195e6173809dc |
hex | bfee8983b6a8 |
211031230232232 has 96 divisors (see below), whose sum is σ = 601710725460000. Its totient is φ = 66631848048000.
The previous prime is 211031230232149. The next prime is 211031230232269. The reversal of 211031230232232 is 232232032130112.
211031230232232 is a `hidden beast` number, since 2 + 1 + 1 + 0 + 3 + 1 + 2 + 302 + 322 + 32 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 211031230232196 and 211031230232205.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1593394 + ... + 20605857.
It is an arithmetic number, because the mean of its divisors is an integer number (6267820056875).
Almost surely, 2211031230232232 is an apocalyptic number.
It is an amenable number.
211031230232232 is an abundant number, since it is smaller than the sum of its proper divisors (390679495227768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211031230232232 is a wasteful number, since it uses less digits than its factorization.
211031230232232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22206231 (or 22206224 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 211031230232232 its reverse (232232032130112), we get a palindrome (443263262362344).
The spelling of 211031230232232 in words is "two hundred eleven trillion, thirty-one billion, two hundred thirty million, two hundred thirty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •