Base | Representation |
---|---|
bin | 1010100011001111010001… |
… | …01011001110001101111000 |
3 | 10001010222220010002222002002 |
4 | 11101213220223032031320 |
5 | 11020111143113311412 |
6 | 121202222525000132 |
7 | 4613134645124453 |
oct | 521475053161570 |
9 | 101128803088062 |
10 | 23201022010232 |
11 | 7435553091370 |
12 | 272861b3b3048 |
13 | cc3b01aa8391 |
14 | 5a2d14c7249a |
15 | 2a37a262bdc2 |
hex | 1519e8ace378 |
23201022010232 has 32 divisors (see below), whose sum is σ = 47460950974080. Its totient is φ = 10544960196960.
The previous prime is 23201022010219. The next prime is 23201022010247.
It is a happy number.
23201022010232 is nontrivially palindromic in base 10.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11012468 + ... + 12948995.
It is an arithmetic number, because the mean of its divisors is an integer number (1483154717940).
Almost surely, 223201022010232 is an apocalyptic number.
23201022010232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23201022010232 is an abundant number, since it is smaller than the sum of its proper divisors (24259928963848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23201022010232 is a wasteful number, since it uses less digits than its factorization.
23201022010232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23972483 (or 23972479 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
It can be divided in two parts, 2320102 and 2010232, that added together give a palindrome (4330334).
The spelling of 23201022010232 in words is "twenty-three trillion, two hundred one billion, twenty-two million, ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •