Base | Representation |
---|---|
bin | 101101010010010111101… |
… | …011101001010010000011 |
3 | 102000111212200022101000002 |
4 | 231102113223221102003 |
5 | 401442040341420303 |
6 | 10341402435350215 |
7 | 440561524040132 |
oct | 55222753512203 |
9 | 12014780271002 |
10 | 3112101123203 |
11 | a9a91aa51846 |
12 | 42319045236b |
13 | 19761541bc77 |
14 | aa8ab179919 |
15 | 55e46026788 |
hex | 2d497ae9483 |
3112101123203 has 8 divisors (see below), whose sum is σ = 3212513951616. Its totient is φ = 3011689699200.
The previous prime is 3112101123181. The next prime is 3112101123227. The reversal of 3112101123203 is 3023211012113.
It is a happy number.
3112101123203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3112101123203 - 232 = 3107806155907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3112101123283) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5944283 + ... + 6446603.
It is an arithmetic number, because the mean of its divisors is an integer number (401564243952).
Almost surely, 23112101123203 is an apocalyptic number.
3112101123203 is a deficient number, since it is larger than the sum of its proper divisors (100412828413).
3112101123203 is a wasteful number, since it uses less digits than its factorization.
3112101123203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702205.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3112101123203 its reverse (3023211012113), we get a palindrome (6135312135316).
The spelling of 3112101123203 in words is "three trillion, one hundred twelve billion, one hundred one million, one hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •