Base | Representation |
---|---|
bin | 10011011001101011010… |
… | …011000001110101001000 |
3 | 11201110022210022000122120 |
4 | 103121223103001311020 |
5 | 133320433420341404 |
6 | 2500252040251240 |
7 | 165215634055560 |
oct | 23315323016510 |
9 | 4643283260576 |
10 | 1333240012104 |
11 | 474473258280 |
12 | 196483470b20 |
13 | 989547ca260 |
14 | 4875a035da0 |
15 | 24a322029d9 |
hex | 1366b4c1d48 |
1333240012104 has 256 divisors, whose sum is σ = 4669787566080. Its totient is φ = 305759646720.
The previous prime is 1333240012033. The next prime is 1333240012129. The reversal of 1333240012104 is 4012100423331.
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 (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 653887 + ... + 1758990.
It is an arithmetic number, because the mean of its divisors is an integer number (18241357680).
Almost surely, 21333240012104 is an apocalyptic number.
1333240012104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1333240012104 is an abundant number, since it is smaller than the sum of its proper divisors (3336547553976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1333240012104 is a wasteful number, since it uses less digits than its factorization.
1333240012104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2412940 (or 2412936 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1333240012104 its reverse (4012100423331), we get a palindrome (5345340435435).
The spelling of 1333240012104 in words is "one trillion, three hundred thirty-three billion, two hundred forty million, twelve thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •