Base | Representation |
---|---|
bin | 10101100110111000… |
… | …110101001010001001 |
3 | 2012212220210102220021 |
4 | 111212320311022021 |
5 | 340003424312223 |
6 | 14354114100441 |
7 | 1450641222325 |
oct | 254670651211 |
9 | 65786712807 |
10 | 23201010313 |
11 | 9926402498 |
12 | 45b5b7a721 |
13 | 225990b290 |
14 | 11a1494985 |
15 | 90bcb865d |
hex | 566e35289 |
23201010313 has 8 divisors (see below), whose sum is σ = 25074624456. Its totient is φ = 21340099200.
The previous prime is 23201010241. The next prime is 23201010353. The reversal of 23201010313 is 31301010232.
It can be written as a sum of positive squares in 4 ways, for example, as 3588968464 + 19612041849 = 59908^2 + 140043^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23201010313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23201010353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3171958 + ... + 3179263.
It is an arithmetic number, because the mean of its divisors is an integer number (3134328057).
Almost surely, 223201010313 is an apocalyptic number.
It is an amenable number.
23201010313 is a deficient number, since it is larger than the sum of its proper divisors (1873614143).
23201010313 is a wasteful number, since it uses less digits than its factorization.
23201010313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6351515.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 23201010313 its reverse (31301010232), we get a palindrome (54502020545).
The spelling of 23201010313 in words is "twenty-three billion, two hundred one million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •