Base | Representation |
---|---|
bin | 1000100100011010… |
… | …1011110101100101 |
3 | 12221022021211202020 |
4 | 2021012223311211 |
5 | 14202324343023 |
6 | 1020125533353 |
7 | 111000432603 |
oct | 21106536545 |
9 | 5838254666 |
10 | 2300231013 |
11 | a80469673 |
12 | 542414259 |
13 | 2a8726352 |
14 | 17b6cc873 |
15 | d6e19de3 |
hex | 891abd65 |
2300231013 has 8 divisors (see below), whose sum is σ = 3068196576. Its totient is φ = 1532876400.
The previous prime is 2300230987. The next prime is 2300231023. The reversal of 2300231013 is 3101320032.
2300231013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2300231013 - 25 = 2300230981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2300230983 and 2300231001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300231023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143878 + ... + 159063.
It is an arithmetic number, because the mean of its divisors is an integer number (383524572).
Almost surely, 22300231013 is an apocalyptic number.
It is an amenable number.
2300231013 is a deficient number, since it is larger than the sum of its proper divisors (767965563).
2300231013 is a wasteful number, since it uses less digits than its factorization.
2300231013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305475.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 2300231013 is about 47960.7236496698. The cubic root of 2300231013 is about 1320.0503143126.
Adding to 2300231013 its reverse (3101320032), we get a palindrome (5401551045).
The spelling of 2300231013 in words is "two billion, three hundred million, two hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •