Base | Representation |
---|---|
bin | 111001010100110000… |
… | …1110111101000101111 |
3 | 102202202021121012211220 |
4 | 1302221201313220233 |
5 | 4004103421444211 |
6 | 132315231114423 |
7 | 11615420614341 |
oct | 1625141675057 |
9 | 382667535756 |
10 | 123103312431 |
11 | 48231679740 |
12 | 1ba37072a13 |
13 | b7bb102008 |
14 | 5d5b563291 |
15 | 3307655806 |
hex | 1ca9877a2f |
123103312431 has 16 divisors (see below), whose sum is σ = 179907996288. Its totient is φ = 74254471200.
The previous prime is 123103312427. The next prime is 123103312447. The reversal of 123103312431 is 134213301321.
It is not a de Polignac number, because 123103312431 - 22 = 123103312427 is a prime.
It is a super-2 number, since 2×1231033124312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123103312331) 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, 8832856 + ... + 8846781.
It is an arithmetic number, because the mean of its divisors is an integer number (11244249768).
Almost surely, 2123103312431 is an apocalyptic number.
123103312431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
123103312431 is a deficient number, since it is larger than the sum of its proper divisors (56804683857).
123103312431 is a wasteful number, since it uses less digits than its factorization.
123103312431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17679862.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 123103312431 its reverse (134213301321), we get a palindrome (257316613752).
It can be divided in two parts, 123103 and 312431, that added together give a palindrome (435534).
The spelling of 123103312431 in words is "one hundred twenty-three billion, one hundred three million, three hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •