Base | Representation |
---|---|
bin | 100101011011001101100… |
… | …0100111000101100101001 |
3 | 200012201201201212120112010 |
4 | 1022312123010320230221 |
5 | 1133233222431240401 |
6 | 14534550050110133 |
7 | 1040422061142666 |
oct | 112663304705451 |
9 | 20181651776463 |
10 | 5143677602601 |
11 | 170346aa0299a |
12 | 6b0a6727b349 |
13 | 2b407b837475 |
14 | 13ad535a4a6d |
15 | 8dbeb232ed6 |
hex | 4ad9b138b29 |
5143677602601 has 4 divisors (see below), whose sum is σ = 6858236803472. Its totient is φ = 3429118401732.
The previous prime is 5143677602579. The next prime is 5143677602617. The reversal of 5143677602601 is 1062067763415.
It is a happy number.
5143677602601 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5143677602601 - 27 = 5143677602473 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5143677602641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 857279600431 + ... + 857279600436.
It is an arithmetic number, because the mean of its divisors is an integer number (1714559200868).
Almost surely, 25143677602601 is an apocalyptic number.
It is an amenable number.
5143677602601 is a deficient number, since it is larger than the sum of its proper divisors (1714559200871).
5143677602601 is a wasteful number, since it uses less digits than its factorization.
5143677602601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1714559200870.
The product of its (nonzero) digits is 1270080, while the sum is 48.
The spelling of 5143677602601 in words is "five trillion, one hundred forty-three billion, six hundred seventy-seven million, six hundred two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •