Base | Representation |
---|---|
bin | 1010011110000111100001… |
… | …10110110111110000010010 |
3 | 10000112011201102010100010110 |
4 | 11033003300312313300102 |
5 | 11004220313244410141 |
6 | 120545322532542150 |
7 | 4564335406402521 |
oct | 517036066676022 |
9 | 100464642110113 |
10 | 23025065622546 |
11 | 737796a310a49 |
12 | 26ba4b3a81956 |
13 | cb033cb15350 |
14 | 5985c21004b8 |
15 | 29de04e10e16 |
hex | 14f0f0db7c12 |
23025065622546 has 32 divisors (see below), whose sum is σ = 49593608265600. Its totient is φ = 7084469971584.
The previous prime is 23025065622527. The next prime is 23025065622547. The reversal of 23025065622546 is 64522656052032.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23025065622495 and 23025065622504.
It is not an unprimeable number, because it can be changed into a prime (23025065622547) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 70750 + ... + 6786393.
It is an arithmetic number, because the mean of its divisors is an integer number (1549800258300).
Almost surely, 223025065622546 is an apocalyptic number.
23025065622546 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
23025065622546 is an abundant number, since it is smaller than the sum of its proper divisors (26568542643054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23025065622546 is a wasteful number, since it uses less digits than its factorization.
23025065622546 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6900210.
The product of its (nonzero) digits is 5184000, while the sum is 48.
The spelling of 23025065622546 in words is "twenty-three trillion, twenty-five billion, sixty-five million, six hundred twenty-two thousand, five hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •