Base | Representation |
---|---|
bin | 100101000010000011111… |
… | …0111110110111011000111 |
3 | 200000120022201220012200022 |
4 | 1022010013313312323013 |
5 | 1131342120043013114 |
6 | 14454054504005355 |
7 | 1033500503661251 |
oct | 112040767667307 |
9 | 20016281805608 |
10 | 5089668329159 |
11 | 16925750a2417 |
12 | 6a24b376085b |
13 | 2abc5227a0bb |
14 | 1384ac5c8cd1 |
15 | 8c5d98d548e |
hex | 4a107df6ec7 |
5089668329159 has 8 divisors (see below), whose sum is σ = 5177245489920. Its totient is φ = 5002134888376.
The previous prime is 5089668329147. The next prime is 5089668329173. The reversal of 5089668329159 is 9519238669805.
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 5089668329159 - 220 = 5089667280583 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5089668329092 and 5089668329101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5089668329189) 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, 10695119 + ... + 11160864.
It is an arithmetic number, because the mean of its divisors is an integer number (647155686240).
Almost surely, 25089668329159 is an apocalyptic number.
5089668329159 is a gapful number since it is divisible by the number (59) formed by its first and last digit.
5089668329159 is a deficient number, since it is larger than the sum of its proper divisors (87577160761).
5089668329159 is a wasteful number, since it uses less digits than its factorization.
5089668329159 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21859989.
The product of its (nonzero) digits is 251942400, while the sum is 71.
The spelling of 5089668329159 in words is "five trillion, eighty-nine billion, six hundred sixty-eight million, three hundred twenty-nine thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •