Base | Representation |
---|---|
bin | 1001000101001101001… |
… | …00011000100110001100 |
3 | 1002211102001122011200220 |
4 | 10202212210120212030 |
5 | 20103020220413400 |
6 | 355202352551340 |
7 | 31354306643004 |
oct | 4424644304614 |
9 | 1084361564626 |
10 | 312032201100 |
11 | 110372052054 |
12 | 50582b52550 |
13 | 23569859229 |
14 | 11161143004 |
15 | 81b3b907a0 |
hex | 48a691898c |
312032201100 has 72 divisors (see below), whose sum is σ = 903902927760. Its totient is φ = 83108148480.
The previous prime is 312032201083. The next prime is 312032201101. The reversal of 312032201100 is 1102230213.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 312032201100.
It is not an unprimeable number, because it can be changed into a prime (312032201101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 378627 + ... + 876026.
It is an arithmetic number, because the mean of its divisors is an integer number (12554207330).
Almost surely, 2312032201100 is an apocalyptic number.
312032201100 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
312032201100 is an abundant number, since it is smaller than the sum of its proper divisors (591870726660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312032201100 is a wasteful number, since it uses less digits than its factorization.
312032201100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255499 (or 1255492 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 312032201100 its reverse (1102230213), we get a palindrome (313134431313).
The spelling of 312032201100 in words is "three hundred twelve billion, thirty-two million, two hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •