Base | Representation |
---|---|
bin | 1000100100011001… |
… | …0011011100110011 |
3 | 12221022002202201121 |
4 | 2021012103130303 |
5 | 14202313143443 |
6 | 1020123443111 |
7 | 110666535433 |
oct | 21106233463 |
9 | 5838082647 |
10 | 2300131123 |
11 | a80400614 |
12 | 542386497 |
13 | 2a86bca44 |
14 | 17b6a42c3 |
15 | d6dea4ed |
hex | 89193733 |
2300131123 has 16 divisors (see below), whose sum is σ = 2438055936. Its totient is φ = 2165474080.
The previous prime is 2300131121. The next prime is 2300131157. The reversal of 2300131123 is 3211310032.
It is a cyclic number.
It is not a de Polignac number, because 2300131123 - 21 = 2300131121 is a prime.
It is a super-2 number, since 2×23001311232 = 10581206365986482258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2300131097 and 2300131106.
It is not an unprimeable number, because it can be changed into a prime (2300131121) 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, 1800561 + ... + 1801837.
It is an arithmetic number, because the mean of its divisors is an integer number (152378496).
Almost surely, 22300131123 is an apocalyptic number.
2300131123 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2300131123 is a deficient number, since it is larger than the sum of its proper divisors (137924813).
2300131123 is a wasteful number, since it uses less digits than its factorization.
2300131123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2474.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 2300131123 is about 47959.6822654196. The cubic root of 2300131123 is about 1320.0312058356.
Adding to 2300131123 its reverse (3211310032), we get a palindrome (5511441155).
The spelling of 2300131123 in words is "two billion, three hundred million, one hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •