Base | Representation |
---|---|
bin | 1010011111100000001000… |
… | …10100001110001100100110 |
3 | 10000200201111201112200100010 |
4 | 11033300010110032030212 |
5 | 11011010230000132011 |
6 | 121023231210431050 |
7 | 4600641306161442 |
oct | 517600424161446 |
9 | 100621451480303 |
10 | 23072636724006 |
11 | 7396060a23631 |
12 | 270776b432486 |
13 | cb49815bb8ac |
14 | 59aa1600b822 |
15 | 2a028b4221a6 |
hex | 14fc0450e326 |
23072636724006 has 8 divisors (see below), whose sum is σ = 46145273448024. Its totient is φ = 7690878908000.
The previous prime is 23072636723993. The next prime is 23072636724019. The reversal of 23072636724006 is 60042763627032.
It is an interprime number because it is at equal distance from previous prime (23072636723993) and next prime (23072636724019).
It is a sphenic number, since it is the product of 3 distinct primes.
23072636724006 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1922719726995 + ... + 1922719727006.
It is an arithmetic number, because the mean of its divisors is an integer number (5768159181003).
Almost surely, 223072636724006 is an apocalyptic number.
23072636724006 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23072636724006 is a wasteful number, since it uses less digits than its factorization.
23072636724006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3845439454006.
The product of its (nonzero) digits is 3048192, while the sum is 48.
The spelling of 23072636724006 in words is "twenty-three trillion, seventy-two billion, six hundred thirty-six million, seven hundred twenty-four thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •