Base | Representation |
---|---|
bin | 10101011100111000… |
… | …110101110110111111 |
3 | 2012110020002212200212 |
4 | 111130320311312333 |
5 | 334133002203043 |
6 | 14325322143035 |
7 | 1443533214122 |
oct | 253470656677 |
9 | 65406085625 |
10 | 23033241023 |
11 | 984a733991 |
12 | 4569951a7b |
13 | 2230c2a400 |
14 | 11870a23b9 |
15 | 8ec1c9018 |
hex | 55ce35dbf |
23033241023 has 12 divisors (see below), whose sum is σ = 24990414120. Its totient is φ = 21219602976.
The previous prime is 23033241019. The next prime is 23033241037. The reversal of 23033241023 is 32014233032.
It is not a de Polignac number, because 23033241023 - 22 = 23033241019 is a prime.
It is a super-2 number, since 2×230332410232 (a number of 22 digits) contains 22 as substring.
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 23033241023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23033241043) 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 11 ways as a sum of consecutive naturals, for example, 47861 + ... + 219902.
It is an arithmetic number, because the mean of its divisors is an integer number (2082534510).
Almost surely, 223033241023 is an apocalyptic number.
23033241023 is a deficient number, since it is larger than the sum of its proper divisors (1957173097).
23033241023 is a wasteful number, since it uses less digits than its factorization.
23033241023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268298 (or 268285 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 23033241023 its reverse (32014233032), we get a palindrome (55047474055).
The spelling of 23033241023 in words is "twenty-three billion, thirty-three million, two hundred forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •