Base | Representation |
---|---|
bin | 11001000100000110110010… |
… | …011110111111100101001000 |
3 | 112110022012111022100001020121 |
4 | 121010012302132333211020 |
5 | 103422030330002333112 |
6 | 1030240254234033024 |
7 | 32135044453026226 |
oct | 3104066236774510 |
9 | 473265438301217 |
10 | 110233330121032 |
11 | 3213a769092668 |
12 | 10443b5b278774 |
13 | 4967c5c882b31 |
14 | 1d31470847b16 |
15 | cb264dd13407 |
hex | 6441b27bf948 |
110233330121032 has 32 divisors (see below), whose sum is σ = 216539233009920. Its totient is φ = 52542607993920.
The previous prime is 110233330121017. The next prime is 110233330121039. The reversal of 110233330121032 is 230121033332011.
It is a junction number, because it is equal to n+sod(n) for n = 110233330120988 and 110233330121006.
It is not an unprimeable number, because it can be changed into a prime (110233330121039) 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, 3317067223 + ... + 3317100454.
It is an arithmetic number, because the mean of its divisors is an integer number (6766851031560).
Almost surely, 2110233330121032 is an apocalyptic number.
It is an amenable number.
110233330121032 is a deficient number, since it is larger than the sum of its proper divisors (106305902888888).
110233330121032 is a wasteful number, since it uses less digits than its factorization.
110233330121032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6634167781 (or 6634167777 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 110233330121032 its reverse (230121033332011), we get a palindrome (340354363453043).
The spelling of 110233330121032 in words is "one hundred ten trillion, two hundred thirty-three billion, three hundred thirty million, one hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •