Base | Representation |
---|---|
bin | 111001011010101100… |
… | …0111101000101001111 |
3 | 102210021011000221021002 |
4 | 1302311120331011033 |
5 | 4010010342131111 |
6 | 132351100130515 |
7 | 11623355163056 |
oct | 1626530750517 |
9 | 383234027232 |
10 | 123302302031 |
11 | 48323a31557 |
12 | 1ba91836a3b |
13 | b8203c443c |
14 | 5d79b6139d |
15 | 3319d6063b |
hex | 1cb563d14f |
123302302031 has 4 divisors (see below), whose sum is σ = 123308353992. Its totient is φ = 123296250072.
The previous prime is 123302302027. The next prime is 123302302033. The reversal of 123302302031 is 130203203321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 123302302031 - 22 = 123302302027 is a prime.
It is a super-2 number, since 2×1233023020312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123302301994 and 123302302012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123302302033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2995316 + ... + 3036201.
It is an arithmetic number, because the mean of its divisors is an integer number (30827088498).
Almost surely, 2123302302031 is an apocalyptic number.
123302302031 is a deficient number, since it is larger than the sum of its proper divisors (6051961).
123302302031 is an equidigital number, since it uses as much as digits as its factorization.
123302302031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6051960.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 123302302031 its reverse (130203203321), we get a palindrome (253505505352).
The spelling of 123302302031 in words is "one hundred twenty-three billion, three hundred two million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •