Base | Representation |
---|---|
bin | 1010100110001011100101… |
… | …01110001110101000110000 |
3 | 10001111122211222010220212202 |
4 | 11103011302232032220300 |
5 | 11023240221302131000 |
6 | 121320502555042332 |
7 | 4623344212332623 |
oct | 523056256165060 |
9 | 101448758126782 |
10 | 23302122302000 |
11 | 7474413610a03 |
12 | 27441357403a8 |
13 | 10004c453b529 |
14 | 5a7b860a9dba |
15 | 2a621d258dd5 |
hex | 153172b8ea30 |
23302122302000 has 40 divisors (see below), whose sum is σ = 56344531731072. Its totient is φ = 9320848920000.
The previous prime is 23302122301999. The next prime is 23302122302027. The reversal of 23302122302000 is 20322120332.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-3 number, since 3×233021223020003 (a number of 41 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5825528576 + ... + 5825532575.
Almost surely, 223302122302000 is an apocalyptic number.
23302122302000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23302122302000 is an abundant number, since it is smaller than the sum of its proper divisors (33042409429072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23302122302000 is a wasteful number, since it uses less digits than its factorization.
23302122302000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11651061174 (or 11651061158 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 23302122302000 its reverse (20322120332), we get a palindrome (23322444422332).
The spelling of 23302122302000 in words is "twenty-three trillion, three hundred two billion, one hundred twenty-two million, three hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •