Base | Representation |
---|---|
bin | 11011010101001001111010… |
… | …000110101100001011100000 |
3 | 120202121002210120222122210001 |
4 | 123111021322012230023200 |
5 | 111223333123322220112 |
6 | 1103351324551345344 |
7 | 34214143626210355 |
oct | 3325117206541340 |
9 | 522532716878701 |
10 | 120201003320032 |
11 | 35332a60816618 |
12 | 11593914982254 |
13 | 520bba157922b |
14 | 2197a8c4c462c |
15 | dd6a85c14c57 |
hex | 6d527a1ac2e0 |
120201003320032 has 12 divisors (see below), whose sum is σ = 236645725286376. Its totient is φ = 60100501660000.
The previous prime is 120201003319987. The next prime is 120201003320033. The reversal of 120201003320032 is 230023300102021.
It is a super-2 number, since 2×1202010033200322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120201003319991 and 120201003320009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120201003320033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1878140676844 + ... + 1878140676907.
It is an arithmetic number, because the mean of its divisors is an integer number (19720477107198).
Almost surely, 2120201003320032 is an apocalyptic number.
It is an amenable number.
120201003320032 is a deficient number, since it is larger than the sum of its proper divisors (116444721966344).
120201003320032 is an equidigital number, since it uses as much as digits as its factorization.
120201003320032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3756281353761 (or 3756281353753 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 120201003320032 its reverse (230023300102021), we get a palindrome (350224303422053).
The spelling of 120201003320032 in words is "one hundred twenty trillion, two hundred one billion, three million, three hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •