Base | Representation |
---|---|
bin | 10101110011011010… |
… | …010101011110100001 |
3 | 2020102120011010020202 |
4 | 111303122111132201 |
5 | 340421221320113 |
6 | 14431021314545 |
7 | 1456102144160 |
oct | 256332253641 |
9 | 66376133222 |
10 | 23411120033 |
11 | 9a23a6aa94 |
12 | 4654405a55 |
13 | 22912c5062 |
14 | 11c13493d7 |
15 | 92046d258 |
hex | 5736957a1 |
23411120033 has 8 divisors (see below), whose sum is σ = 27194182080. Its totient is φ = 19737712080.
The previous prime is 23411120027. The next prime is 23411120059. The reversal of 23411120033 is 33002111432.
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 23411120033 - 224 = 23394342817 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23411119987 and 23411120014.
It is not an unprimeable number, because it can be changed into a prime (23411120093) 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, 27413063 + ... + 27413916.
It is an arithmetic number, because the mean of its divisors is an integer number (3399272760).
Almost surely, 223411120033 is an apocalyptic number.
It is an amenable number.
23411120033 is a deficient number, since it is larger than the sum of its proper divisors (3783062047).
23411120033 is an equidigital number, since it uses as much as digits as its factorization.
23411120033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54827047.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 23411120033 its reverse (33002111432), we get a palindrome (56413231465).
The spelling of 23411120033 in words is "twenty-three billion, four hundred eleven million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •