Base | Representation |
---|---|
bin | 100100011001110110110011… |
… | …1111011001001100001000000 |
3 | 1112222210001210122112012201102 |
4 | 1020303231213323021201000 |
5 | 313432332241224441000 |
6 | 3053011500233153532 |
7 | 124306425254341550 |
oct | 11063554773114100 |
9 | 1488701718465642 |
10 | 320213030312000 |
11 | 93036646746a51 |
12 | 2bab751bb5b8a8 |
13 | 10989c614606b7 |
14 | 5910571551160 |
15 | 2704720aa73d5 |
hex | 1233b67ec9840 |
320213030312000 has 112 divisors (see below), whose sum is σ = 906294365378688. Its totient is φ = 109787324659200.
The previous prime is 320213030311991. The next prime is 320213030312003. The reversal of 320213030312000 is 213030312023.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (320213030312003) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2858988914 + ... + 2859100913.
Almost surely, 2320213030312000 is an apocalyptic number.
It is an amenable number.
320213030312000 is an abundant number, since it is smaller than the sum of its proper divisors (586081335066688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
320213030312000 is an equidigital number, since it uses as much as digits as its factorization.
320213030312000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5718089861 (or 5718089841 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 320213030312000 its reverse (213030312023), we get a palindrome (320426060624023).
The spelling of 320213030312000 in words is "three hundred twenty trillion, two hundred thirteen billion, thirty million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •