Base | Representation |
---|---|
bin | 1010100101000011000001… |
… | …10010001101111001100000 |
3 | 10001100221022002012212020220 |
4 | 11102201200302031321200 |
5 | 11022120431130331000 |
6 | 121250541244203040 |
7 | 4620464645636202 |
oct | 522414062157140 |
9 | 101327262185226 |
10 | 23263166652000 |
11 | 7459943118540 |
12 | 2738683539480 |
13 | cc9926953962 |
14 | 5a5d2c4b2772 |
15 | 2a51dd2b41a0 |
hex | 152860c8de60 |
23263166652000 has 768 divisors, whose sum is σ = 83891254487040. Its totient is φ = 5588683776000.
The previous prime is 23263166651999. The next prime is 23263166652017. The reversal of 23263166652000 is 25666136232.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9097834722 + ... + 9097837278.
It is an arithmetic number, because the mean of its divisors is an integer number (109233404280).
Almost surely, 223263166652000 is an apocalyptic number.
23263166652000 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 23263166652000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41945627243520).
23263166652000 is an abundant number, since it is smaller than the sum of its proper divisors (60628087835040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23263166652000 is a wasteful number, since it uses less digits than its factorization.
23263166652000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3192 (or 3174 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 42.
The spelling of 23263166652000 in words is "twenty-three trillion, two hundred sixty-three billion, one hundred sixty-six million, six hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •