Base | Representation |
---|---|
bin | 111001010010100111… |
… | …0011010011101010001 |
3 | 102202120020201121120010 |
4 | 1302211032122131101 |
5 | 4003431430301223 |
6 | 132304131305133 |
7 | 11613553060206 |
oct | 1624516323521 |
9 | 382506647503 |
10 | 123031103313 |
11 | 481a4939988 |
12 | 1ba16a4b1a9 |
13 | b7a916bb21 |
14 | 5d51b27cad |
15 | 3301140393 |
hex | 1ca539a751 |
123031103313 has 16 divisors (see below), whose sum is σ = 175505979200. Its totient is φ = 76430018880.
The previous prime is 123031103287. The next prime is 123031103341. The reversal of 123031103313 is 313301130321.
It is not a de Polignac number, because 123031103313 - 28 = 123031103057 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 123031103313.
It is not an unprimeable number, because it can be changed into a prime (123031103213) 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 15 ways as a sum of consecutive naturals, for example, 17688658 + ... + 17695611.
It is an arithmetic number, because the mean of its divisors is an integer number (10969123700).
Almost surely, 2123031103313 is an apocalyptic number.
It is an amenable number.
123031103313 is a deficient number, since it is larger than the sum of its proper divisors (52474875887).
123031103313 is a wasteful number, since it uses less digits than its factorization.
123031103313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35384352.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 123031103313 its reverse (313301130321), we get a palindrome (436332233634).
The spelling of 123031103313 in words is "one hundred twenty-three billion, thirty-one million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •