Base | Representation |
---|---|
bin | 100101100000001101001… |
… | …0111011011001001000101 |
3 | 200020202102012210110111210 |
4 | 1023000122113123021011 |
5 | 1133422204143301201 |
6 | 14543522230522033 |
7 | 1041251625325224 |
oct | 113003227331105 |
9 | 20222365713453 |
10 | 5154403103301 |
11 | 1707a741a4361 |
12 | 6b2b5b206319 |
13 | 2b509a92209a |
14 | 13b68dc1ccbb |
15 | 8e127b4e1d6 |
hex | 4b01a5db245 |
5154403103301 has 8 divisors (see below), whose sum is σ = 7040160336384. Its totient is φ = 3352457302880.
The previous prime is 5154403103287. The next prime is 5154403103327. The reversal of 5154403103301 is 1033013044515.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5154403103301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5154403103351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20952858021 + ... + 20952858266.
It is an arithmetic number, because the mean of its divisors is an integer number (880020042048).
Almost surely, 25154403103301 is an apocalyptic number.
It is an amenable number.
5154403103301 is a deficient number, since it is larger than the sum of its proper divisors (1885757233083).
5154403103301 is a wasteful number, since it uses less digits than its factorization.
5154403103301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41905716331.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 5154403103301 its reverse (1033013044515), we get a palindrome (6187416147816).
The spelling of 5154403103301 in words is "five trillion, one hundred fifty-four billion, four hundred three million, one hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.566 sec. • engine limits •