Base | Representation |
---|---|
bin | 1010011101011101111100… |
… | …11010011010111001100011 |
3 | 10000110001002210221011010101 |
4 | 11032232332122122321203 |
5 | 11003334110040421133 |
6 | 120531152005043231 |
7 | 4562615310613435 |
oct | 516567632327143 |
9 | 100401083834111 |
10 | 23002744467043 |
11 | 73694556314a0 |
12 | 26b61046b6517 |
13 | cab1c3599223 |
14 | 5974a5840655 |
15 | 29d54a4e537d |
hex | 14ebbe69ae63 |
23002744467043 has 8 divisors (see below), whose sum is σ = 25151856646896. Its totient is φ = 20863291219200.
The previous prime is 23002744467013. The next prime is 23002744467067. The reversal of 23002744467043 is 34076444720032.
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 23002744467043 - 213 = 23002744458851 is a prime.
It is a super-2 number, since 2×230027444670432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23002744466984 and 23002744467002.
It is not an unprimeable number, because it can be changed into a prime (23002744467013) 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, 2414728018 + ... + 2414737543.
It is an arithmetic number, because the mean of its divisors is an integer number (3143982080862).
Almost surely, 223002744467043 is an apocalyptic number.
23002744467043 is a deficient number, since it is larger than the sum of its proper divisors (2149112179853).
23002744467043 is a wasteful number, since it uses less digits than its factorization.
23002744467043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4829466005.
The product of its (nonzero) digits is 2709504, while the sum is 46.
The spelling of 23002744467043 in words is "twenty-three trillion, two billion, seven hundred forty-four million, four hundred sixty-seven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •