Base | Representation |
---|---|
bin | 10011011001110110001… |
… | …010111001101100100100 |
3 | 11201110210111112212100102 |
4 | 103121312022321230210 |
5 | 133321322120243022 |
6 | 2500322114203232 |
7 | 165223310440250 |
oct | 23316612715444 |
9 | 4643714485312 |
10 | 1333422431012 |
11 | 474557222301 |
12 | 196514583518 |
13 | 9898353a139 |
14 | 4877635d260 |
15 | 24a43237a92 |
hex | 136762b9b24 |
1333422431012 has 96 divisors (see below), whose sum is σ = 2907486624000. Its totient is φ = 522715866624.
The previous prime is 1333422430943. The next prime is 1333422431021. The reversal of 1333422431012 is 2101342243331.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12923564 + ... + 13026332.
It is an arithmetic number, because the mean of its divisors is an integer number (30286319000).
Almost surely, 21333422431012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1333422431012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1453743312000).
1333422431012 is an abundant number, since it is smaller than the sum of its proper divisors (1574064192988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1333422431012 is a wasteful number, since it uses less digits than its factorization.
1333422431012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102886 (or 102826 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1333422431012 its reverse (2101342243331), we get a palindrome (3434764674343).
The spelling of 1333422431012 in words is "one trillion, three hundred thirty-three billion, four hundred twenty-two million, four hundred thirty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •