Base | Representation |
---|---|
bin | 1001000101010101001… |
… | …11100001100101100111 |
3 | 1002211120210110111001110 |
4 | 10202222213201211213 |
5 | 20103140113230343 |
6 | 355213221000103 |
7 | 31356063234564 |
oct | 4425247414547 |
9 | 1084523414043 |
10 | 312100133223 |
11 | 1103a74304aa |
12 | 505a1853033 |
13 | 2357a952758 |
14 | 1116a18786b |
15 | 81b9b0d833 |
hex | 48aa9e1967 |
312100133223 has 8 divisors (see below), whose sum is σ = 429557172736. Its totient is φ = 201354924600.
The previous prime is 312100133209. The next prime is 312100133231. The reversal of 312100133223 is 322331001213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 312100133223 - 26 = 312100133159 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 312100133223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312100133203) 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 7 ways as a sum of consecutive naturals, for example, 1677957613 + ... + 1677957798.
It is an arithmetic number, because the mean of its divisors is an integer number (53694646592).
Almost surely, 2312100133223 is an apocalyptic number.
312100133223 is a deficient number, since it is larger than the sum of its proper divisors (117457039513).
312100133223 is a wasteful number, since it uses less digits than its factorization.
312100133223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3355915445.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 312100133223 its reverse (322331001213), we get a palindrome (634431134436).
The spelling of 312100133223 in words is "three hundred twelve billion, one hundred million, one hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •