Base | Representation |
---|---|
bin | 10001111100010101101… |
… | …110011110101111100000 |
3 | 11100212122021220000012001 |
4 | 101330111232132233200 |
5 | 130200211122320112 |
6 | 2342235220213344 |
7 | 155040250043401 |
oct | 21742556365740 |
9 | 4325567800161 |
10 | 1233020120032 |
11 | 435a14792a98 |
12 | 17ab73b3a254 |
13 | 8c37258a27c |
14 | 4396dad59a8 |
15 | 22118a2ec57 |
hex | 11f15b9ebe0 |
1233020120032 has 48 divisors (see below), whose sum is σ = 2571594897312. Its totient is φ = 579953111040.
The previous prime is 1233020120023. The next prime is 1233020120039. The reversal of 1233020120032 is 2300210203321.
It is a junction number, because it is equal to n+sod(n) for n = 1233020119991 and 1233020120009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1233020120039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 515557 + ... + 1652827.
It is an arithmetic number, because the mean of its divisors is an integer number (53574893694).
Almost surely, 21233020120032 is an apocalyptic number.
It is an amenable number.
1233020120032 is an abundant number, since it is smaller than the sum of its proper divisors (1338574777280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1233020120032 is a wasteful number, since it uses less digits than its factorization.
1233020120032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1139291 (or 1139283 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1233020120032 its reverse (2300210203321), we get a palindrome (3533230323353).
The spelling of 1233020120032 in words is "one trillion, two hundred thirty-three billion, twenty million, one hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •