Base | Representation |
---|---|
bin | 1110100011010100110111… |
… | …1110100111010001011111 |
3 | 2002122120221210101010110220 |
4 | 3220311031332213101133 |
5 | 4044121111211441043 |
6 | 54010154324532423 |
7 | 3240652303146246 |
oct | 350651576472137 |
9 | 62576853333426 |
10 | 16000061437023 |
11 | 5109651618a74 |
12 | 1964b04251113 |
13 | 8c0a51149391 |
14 | 3d459b15195d |
15 | 1cb2e94b4483 |
hex | e8d4dfa745f |
16000061437023 has 8 divisors (see below), whose sum is σ = 21853742450736. Its totient is φ = 10406544024000.
The previous prime is 16000061436949. The next prime is 16000061437049. The reversal of 16000061437023 is 32073416000061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16000061437023 - 218 = 16000061174879 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16000061437223) 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, 65040900028 + ... + 65040900273.
It is an arithmetic number, because the mean of its divisors is an integer number (2731717806342).
Almost surely, 216000061437023 is an apocalyptic number.
16000061437023 is a deficient number, since it is larger than the sum of its proper divisors (5853681013713).
16000061437023 is a wasteful number, since it uses less digits than its factorization.
16000061437023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130081800345.
The product of its (nonzero) digits is 18144, while the sum is 33.
Adding to 16000061437023 its reverse (32073416000061), we get a palindrome (48073477437084).
The spelling of 16000061437023 in words is "sixteen trillion, sixty-one million, four hundred thirty-seven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •