Base | Representation |
---|---|
bin | 1001000101100010010… |
… | …11000001000000000110 |
3 | 1002211212110101101102120 |
4 | 10202301023001000012 |
5 | 20103401241201410 |
6 | 355232145550410 |
7 | 31361600031240 |
oct | 4426113010006 |
9 | 1084773341376 |
10 | 312210100230 |
11 | 11045350a326 |
12 | 50612645406 |
13 | 23597675aa2 |
14 | 1117aa11090 |
15 | 81c45d1570 |
hex | 48b12c1006 |
312210100230 has 128 divisors (see below), whose sum is σ = 875118366720. Its totient is φ = 69800002560.
The previous prime is 312210100201. The next prime is 312210100243. The reversal of 312210100230 is 32001012213.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17174586 + ... + 17192754.
It is an arithmetic number, because the mean of its divisors is an integer number (6836862240).
Almost surely, 2312210100230 is an apocalyptic number.
312210100230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 312210100230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (437559183360).
312210100230 is an abundant number, since it is smaller than the sum of its proper divisors (562908266490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312210100230 is a wasteful number, since it uses less digits than its factorization.
312210100230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19974.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 312210100230 its reverse (32001012213), we get a palindrome (344211112443).
The spelling of 312210100230 in words is "three hundred twelve billion, two hundred ten million, one hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •