Base | Representation |
---|---|
bin | 1010101011111100100100… |
… | …11010010111100010110101 |
3 | 10002012121011220112202000122 |
4 | 11111332102122113202311 |
5 | 11040011423422242013 |
6 | 121551504141021325 |
7 | 4643556264035114 |
oct | 525762232274265 |
9 | 102177156482018 |
10 | 23500222462133 |
11 | 754042aa2630a |
12 | 2776600b54845 |
13 | 10160a50819b1 |
14 | 5b35b9b25c7b |
15 | 2ab464a02a08 |
hex | 155f926978b5 |
23500222462133 has 32 divisors (see below), whose sum is σ = 24207486777600. Its totient is φ = 22799791872000.
The previous prime is 23500222462109. The next prime is 23500222462151. The reversal of 23500222462133 is 33126422200532.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23500222462133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23500222462093 and 23500222462102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23500222462033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16797870968 + ... + 16797872366.
It is an arithmetic number, because the mean of its divisors is an integer number (756483961800).
Almost surely, 223500222462133 is an apocalyptic number.
It is an amenable number.
23500222462133 is a deficient number, since it is larger than the sum of its proper divisors (707264315467).
23500222462133 is a wasteful number, since it uses less digits than its factorization.
23500222462133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4029.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 23500222462133 its reverse (33126422200532), we get a palindrome (56626644662665).
The spelling of 23500222462133 in words is "twenty-three trillion, five hundred billion, two hundred twenty-two million, four hundred sixty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •