Base | Representation |
---|---|
bin | 1001000101100010011… |
… | …11101011000111010100 |
3 | 1002211212112200102102101 |
4 | 10202301033223013110 |
5 | 20103402044240200 |
6 | 355232232051444 |
7 | 31361613305224 |
oct | 4426117530724 |
9 | 1084775612371 |
10 | 312211321300 |
11 | 11045417377a |
12 | 50612b33b84 |
13 | 235979b2808 |
14 | 1117ac4c084 |
15 | 81c477326a |
hex | 48b13eb1d4 |
312211321300 has 18 divisors (see below), whose sum is σ = 677498567438. Its totient is φ = 124884528480.
The previous prime is 312211321267. The next prime is 312211321309. The reversal of 312211321300 is 3123112213.
It can be written as a sum of positive squares in 3 ways, for example, as 79179206544 + 233032114756 = 281388^2 + 482734^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312211321309) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 1561056507 + ... + 1561056706.
Almost surely, 2312211321300 is an apocalyptic number.
It is an amenable number.
312211321300 is an abundant number, since it is smaller than the sum of its proper divisors (365287246138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312211321300 is a wasteful number, since it uses less digits than its factorization.
312211321300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3122113227 (or 3122113220 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 312211321300 its reverse (3123112213), we get a palindrome (315334433513).
It can be divided in two parts, 3122113 and 21300, that added together give a palindrome (3143413).
The spelling of 312211321300 in words is "three hundred twelve billion, two hundred eleven million, three hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •