Base | Representation |
---|---|
bin | 100100101110001110010010… |
… | …1010110111100001110101100 |
3 | 1120100200200000211201120101100 |
4 | 1021130130211112330032230 |
5 | 314314213022420414012 |
6 | 3102553434304243100 |
7 | 125015602142664045 |
oct | 11134344526741654 |
9 | 1510620024646340 |
10 | 323012232201132 |
11 | 93a1579a190a71 |
12 | 30289b27010490 |
13 | 10b30bcc500386 |
14 | 59a9c3836d8cc |
15 | 2752451c748dc |
hex | 125c7255bc3ac |
323012232201132 has 18 divisors (see below), whose sum is σ = 816503142508508. Its totient is φ = 107670744067032.
The previous prime is 323012232201107. The next prime is 323012232201149. The reversal of 323012232201132 is 231102232210323.
323012232201132 is a `hidden beast` number, since 3 + 2 + 301 + 2 + 2 + 3 + 220 + 1 + 132 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a junction number, because it is equal to n+sod(n) for n = 323012232201096 and 323012232201105.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4486281002758 + ... + 4486281002829.
Almost surely, 2323012232201132 is an apocalyptic number.
It is an amenable number.
323012232201132 is an abundant number, since it is smaller than the sum of its proper divisors (493490910307376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323012232201132 is a wasteful number, since it uses less digits than its factorization.
323012232201132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8972562005597 (or 8972562005592 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 323012232201132 its reverse (231102232210323), we get a palindrome (554114464411455).
The spelling of 323012232201132 in words is "three hundred twenty-three trillion, twelve billion, two hundred thirty-two million, two hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •