Base | Representation |
---|---|
bin | 10110000001101010… |
… | …000111001110101000 |
3 | 2021001012220102220000 |
4 | 112001222013032220 |
5 | 341413413341000 |
6 | 14510440303000 |
7 | 1465033563510 |
oct | 260152071650 |
9 | 67035812800 |
10 | 23650137000 |
11 | a036981a76 |
12 | 4700471a60 |
13 | 22cb990609 |
14 | 1204da6840 |
15 | 936433000 |
hex | 581a873a8 |
23650137000 has 640 divisors, whose sum is σ = 96385386240. Its totient is φ = 5297011200.
The previous prime is 23650136999. The next prime is 23650137011. The reversal of 23650137000 is 73105632.
It is a happy number.
23650137000 is a `hidden beast` number, since 2 + 3 + 650 + 1 + 3 + 7 + 0 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 30050607 + ... + 30051393.
It is an arithmetic number, because the mean of its divisors is an integer number (150602166).
Almost surely, 223650137000 is an apocalyptic number.
23650137000 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 23650137000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48192693120).
23650137000 is an abundant number, since it is smaller than the sum of its proper divisors (72735249240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23650137000 is a wasteful number, since it uses less digits than its factorization.
23650137000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880 (or 857 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The spelling of 23650137000 in words is "twenty-three billion, six hundred fifty million, one hundred thirty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •