Base | Representation |
---|---|
bin | 10101011011110101… |
… | …010011011000001100 |
3 | 2012101222210101011110 |
4 | 111123311103120030 |
5 | 334113434124030 |
6 | 14323450452020 |
7 | 1443226554312 |
oct | 253365233014 |
9 | 65358711143 |
10 | 23015536140 |
11 | 9840740a53 |
12 | 4563a34010 |
13 | 222a36b84c |
14 | 11849b40b2 |
15 | 8ea87d1b0 |
hex | 55bd5360c |
23015536140 has 96 divisors (see below), whose sum is σ = 66060417024. Its totient is φ = 5983690240.
The previous prime is 23015536127. The next prime is 23015536177. The reversal of 23015536140 is 4163551032.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 23015536098 and 23015536107.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5574757 + ... + 5578883.
It is an arithmetic number, because the mean of its divisors is an integer number (688129344).
Almost surely, 223015536140 is an apocalyptic number.
23015536140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23015536140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33030208512).
23015536140 is an abundant number, since it is smaller than the sum of its proper divisors (43044880884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23015536140 is a wasteful number, since it uses less digits than its factorization.
23015536140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6447 (or 6445 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The spelling of 23015536140 in words is "twenty-three billion, fifteen million, five hundred thirty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •