Base | Representation |
---|---|
bin | 101101011100110011011… |
… | …000100011110000000111 |
3 | 102001120210101011220210211 |
4 | 231130303120203300013 |
5 | 402133011121100403 |
6 | 10350454205100251 |
7 | 441436240005040 |
oct | 55346330436007 |
9 | 12046711156724 |
10 | 3123303300103 |
11 | aa464931a088 |
12 | 425397b57687 |
13 | 1986ac1b36cc |
14 | ab250c378c7 |
15 | 5639e70006d |
hex | 2d733623c07 |
3123303300103 has 16 divisors (see below), whose sum is σ = 3572664848640. Its totient is φ = 2674736510400.
The previous prime is 3123303300097. The next prime is 3123303300107. The reversal of 3123303300103 is 3010033033213.
3123303300103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3123303300103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3123303300107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43947868 + ... + 44018878.
It is an arithmetic number, because the mean of its divisors is an integer number (223291553040).
Almost surely, 23123303300103 is an apocalyptic number.
3123303300103 is a deficient number, since it is larger than the sum of its proper divisors (449361548537).
3123303300103 is a wasteful number, since it uses less digits than its factorization.
3123303300103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76518.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 3123303300103 its reverse (3010033033213), we get a palindrome (6133336333316).
The spelling of 3123303300103 in words is "three trillion, one hundred twenty-three billion, three hundred three million, three hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •