Base | Representation |
---|---|
bin | 10101110010111000… |
… | …000000001111000101 |
3 | 2020101221012212201010 |
4 | 111302320000033011 |
5 | 340411420321013 |
6 | 14430100352433 |
7 | 1455632511330 |
oct | 256270001705 |
9 | 66357185633 |
10 | 23402120133 |
11 | 9a19983257 |
12 | 46513a5719 |
13 | 228c493782 |
14 | 11c0085617 |
15 | 91e7917c3 |
hex | 572e003c5 |
23402120133 has 8 divisors (see below), whose sum is σ = 35660373568. Its totient is φ = 13372640064.
The previous prime is 23402120113. The next prime is 23402120149. The reversal of 23402120133 is 33102120432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23402120133 - 29 = 23402119621 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 1114386673 = 23402120133 / (2 + 3 + 4 + 0 + 2 + 1 + 2 + 0 + 1 + 3 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23402120113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 557193316 + ... + 557193357.
It is an arithmetic number, because the mean of its divisors is an integer number (4457546696).
Almost surely, 223402120133 is an apocalyptic number.
It is an amenable number.
23402120133 is a deficient number, since it is larger than the sum of its proper divisors (12258253435).
23402120133 is a wasteful number, since it uses less digits than its factorization.
23402120133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1114386683.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 23402120133 its reverse (33102120432), we get a palindrome (56504240565).
The spelling of 23402120133 in words is "twenty-three billion, four hundred two million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •