Base | Representation |
---|---|
bin | 10000001100101011000… |
… | …111111010000111100010 |
3 | 10221102011020200222210220 |
4 | 100030223013322013202 |
5 | 121214132211214020 |
6 | 2211205453103510 |
7 | 143264103040332 |
oct | 20145307720742 |
9 | 3842136628726 |
10 | 1113120023010 |
11 | 39a087263516 |
12 | 15b891787b96 |
13 | 80c74cb14b8 |
14 | 3bc37b570c2 |
15 | 1de4c710240 |
hex | 1032b1fa1e2 |
1113120023010 has 32 divisors (see below), whose sum is σ = 2674598114880. Its totient is φ = 296486443968.
The previous prime is 1113120023003. The next prime is 1113120023053. The reversal of 1113120023010 is 103200213111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 21571437 + ... + 21622976.
It is an arithmetic number, because the mean of its divisors is an integer number (83581191090).
Almost surely, 21113120023010 is an apocalyptic number.
1113120023010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1113120023010 is an abundant number, since it is smaller than the sum of its proper divisors (1561478091870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113120023010 is a wasteful number, since it uses less digits than its factorization.
1113120023010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43195282.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1113120023010 its reverse (103200213111), we get a palindrome (1216320236121).
The spelling of 1113120023010 in words is "one trillion, one hundred thirteen billion, one hundred twenty million, twenty-three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •