Base | Representation |
---|---|
bin | 11101011111011011010… |
… | …01010011011001101000 |
3 | 10120212111220220000211220 |
4 | 32233231221103121220 |
5 | 113100221402421440 |
6 | 2053301112422040 |
7 | 133131424536330 |
oct | 16575551233150 |
9 | 3525456800756 |
10 | 1013304342120 |
11 | 360815980064 |
12 | 1444756a7920 |
13 | 74728728825 |
14 | 370893960c0 |
15 | 1b5597838d0 |
hex | ebeda53668 |
1013304342120 has 128 divisors (see below), whose sum is σ = 3657038284800. Its totient is φ = 219422290176.
The previous prime is 1013304342077. The next prime is 1013304342179. The reversal of 1013304342120 is 212434033101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 31729164 + ... + 31761083.
It is an arithmetic number, because the mean of its divisors is an integer number (28570611600).
Almost surely, 21013304342120 is an apocalyptic number.
1013304342120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1013304342120 is an abundant number, since it is smaller than the sum of its proper divisors (2643733942680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013304342120 is a wasteful number, since it uses less digits than its factorization.
1013304342120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63490287 (or 63490283 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1013304342120 its reverse (212434033101), we get a palindrome (1225738375221).
The spelling of 1013304342120 in words is "one trillion, thirteen billion, three hundred four million, three hundred forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •