Base | Representation |
---|---|
bin | 11001000010101000011010… |
… | …111000000101010001110010 |
3 | 112102221111221121012002020212 |
4 | 121002220122320011101302 |
5 | 103413400320043011310 |
6 | 1030121535435304122 |
7 | 32124526453622234 |
oct | 3102503270052162 |
9 | 472844847162225 |
10 | 110132002313330 |
11 | 321007a1196a28 |
12 | 104283a08ab042 |
13 | 495b531c5027a |
14 | 1d2a5bb308254 |
15 | caebbd244205 |
hex | 642a1ae05472 |
110132002313330 has 32 divisors (see below), whose sum is σ = 199467281623104. Its totient is φ = 43779575843136.
The previous prime is 110132002313329. The next prime is 110132002313357. The reversal of 110132002313330 is 33313200231011.
It is a junction number, because it is equal to n+sod(n) for n = 110132002313296 and 110132002313305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21889544 + ... + 26446476.
It is an arithmetic number, because the mean of its divisors is an integer number (6233352550722).
Almost surely, 2110132002313330 is an apocalyptic number.
110132002313330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110132002313330 is a deficient number, since it is larger than the sum of its proper divisors (89335279309774).
110132002313330 is a wasteful number, since it uses less digits than its factorization.
110132002313330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4571930.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 110132002313330 its reverse (33313200231011), we get a palindrome (143445202544341).
The spelling of 110132002313330 in words is "one hundred ten trillion, one hundred thirty-two billion, two million, three hundred thirteen thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •