Base | Representation |
---|---|
bin | 10101011100010010… |
… | …001100011111110101 |
3 | 2012102112001011201201 |
4 | 111130102030133311 |
5 | 334122404011013 |
6 | 14324321052501 |
7 | 1443351131032 |
oct | 253422143765 |
9 | 65375034651 |
10 | 23023110133 |
11 | 9844a44451 |
12 | 4566487131 |
13 | 222bac10ba |
14 | 11859c6389 |
15 | 8eb3773dd |
hex | 55c48c7f5 |
23023110133 has 8 divisors (see below), whose sum is σ = 23166168480. Its totient is φ = 22880212560.
The previous prime is 23023110119. The next prime is 23023110137. The reversal of 23023110133 is 33101132032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23023110133 - 221 = 23021012981 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23023110133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23023110137) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 253738 + ... + 332308.
It is an arithmetic number, because the mean of its divisors is an integer number (2895771060).
Almost surely, 223023110133 is an apocalyptic number.
It is an amenable number.
23023110133 is a deficient number, since it is larger than the sum of its proper divisors (143058347).
23023110133 is a wasteful number, since it uses less digits than its factorization.
23023110133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80387.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 23023110133 its reverse (33101132032), we get a palindrome (56124242165).
The spelling of 23023110133 in words is "twenty-three billion, twenty-three million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •