Base | Representation |
---|---|
bin | 1010100000100101111111… |
… | …11100101010001100101111 |
3 | 10000211022022200212011002102 |
4 | 11100102333330222030233 |
5 | 11012114033431332343 |
6 | 121052353114245315 |
7 | 4603436631163124 |
oct | 520227774521457 |
9 | 100738280764072 |
10 | 23110144402223 |
11 | 73aaa590423aa |
12 | 2712a9872683b |
13 | cb837b1cc828 |
14 | 59c7735a674b |
15 | 2a12341e83b8 |
hex | 1504bff2a32f |
23110144402223 has 8 divisors (see below), whose sum is σ = 23117181415680. Its totient is φ = 23103108272160.
The previous prime is 23110144402217. The next prime is 23110144402243. The reversal of 23110144402223 is 32220444101132.
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 23110144402223 - 26 = 23110144402159 is a prime.
It is a super-3 number, since 3×231101444022233 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23110144402243) 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, 54128498 + ... + 54553776.
It is an arithmetic number, because the mean of its divisors is an integer number (2889647676960).
Almost surely, 223110144402223 is an apocalyptic number.
23110144402223 is a deficient number, since it is larger than the sum of its proper divisors (7037013457).
23110144402223 is a wasteful number, since it uses less digits than its factorization.
23110144402223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441697.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 23110144402223 its reverse (32220444101132), we get a palindrome (55330588503355).
The spelling of 23110144402223 in words is "twenty-three trillion, one hundred ten billion, one hundred forty-four million, four hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •