Base | Representation |
---|---|
bin | 1101101100101100101011… |
… | …10111100111101001000010 |
3 | 10221122202001000202102201020 |
4 | 12312112111313213221002 |
5 | 12422014122212013242 |
6 | 144022211552450310 |
7 | 6226215665401602 |
oct | 666262567475102 |
9 | 127582030672636 |
10 | 30123120032322 |
11 | 9664163a4a689 |
12 | 346608bb49996 |
13 | 13a67a0b46695 |
14 | 761d76c22c02 |
15 | 373888b336ec |
hex | 1b6595de7a42 |
30123120032322 has 8 divisors (see below), whose sum is σ = 60246240064656. Its totient is φ = 10041040010772.
The previous prime is 30123120032297. The next prime is 30123120032323. The reversal of 30123120032322 is 22323002132103.
It is a sphenic number, since it is the product of 3 distinct primes.
30123120032322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 30123120032292 and 30123120032301.
It is not an unprimeable number, because it can be changed into a prime (30123120032323) 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, 2510260002688 + ... + 2510260002699.
It is an arithmetic number, because the mean of its divisors is an integer number (7530780008082).
Almost surely, 230123120032322 is an apocalyptic number.
30123120032322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30123120032322 is a wasteful number, since it uses less digits than its factorization.
30123120032322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5020520005392.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 30123120032322 its reverse (22323002132103), we get a palindrome (52446122164425).
The spelling of 30123120032322 in words is "thirty trillion, one hundred twenty-three billion, one hundred twenty million, thirty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •