Base | Representation |
---|---|
bin | 1101101010010110001100… |
… | …11110110001010011000000 |
3 | 10221101000111201100201001210 |
4 | 12311023012132301103000 |
5 | 12414203143243120412 |
6 | 143521131220130120 |
7 | 6220325655013206 |
oct | 665130636612300 |
9 | 127330451321053 |
10 | 30042331223232 |
11 | 9632976856669 |
12 | 34524a3b36940 |
13 | 139bc97479633 |
14 | 75c0b13d3076 |
15 | 37170b29d83c |
hex | 1b52c67b14c0 |
30042331223232 has 28 divisors (see below), whose sum is σ = 79487001361976. Its totient is φ = 10014110407680.
The previous prime is 30042331223213. The next prime is 30042331223237. The reversal of 30042331223232 is 23232213324003.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 30042331223232.
It is not an unprimeable number, because it can be changed into a prime (30042331223237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78235237369 + ... + 78235237752.
Almost surely, 230042331223232 is an apocalyptic number.
30042331223232 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
30042331223232 is an abundant number, since it is smaller than the sum of its proper divisors (49444670138744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30042331223232 is a wasteful number, since it uses less digits than its factorization.
30042331223232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156470475136 (or 156470475126 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 30042331223232 its reverse (23232213324003), we get a palindrome (53274544547235).
The spelling of 30042331223232 in words is "thirty trillion, forty-two billion, three hundred thirty-one million, two hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •