Base | Representation |
---|---|
bin | 11000101100010111100001… |
… | …00011100010101100010101 |
3 | 21010021010101220210111102002 |
4 | 30112023300203202230111 |
5 | 24104131433133430023 |
6 | 311253312443525045 |
7 | 14303055464564663 |
oct | 1426136043425425 |
9 | 233233356714362 |
10 | 54301012405013 |
11 | 16335a25972910 |
12 | 610ba97229785 |
13 | 243b74300b91a |
14 | d5a27c305c33 |
15 | 64276210ab28 |
hex | 3162f08e2b15 |
54301012405013 has 8 divisors (see below), whose sum is σ = 59238010191360. Its totient is φ = 49364104970880.
The previous prime is 54301012404937. The next prime is 54301012405027. The reversal of 54301012405013 is 31050421010345.
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 54301012405013 - 236 = 54232292928277 is a prime.
It is a super-3 number, since 3×543010124050133 (a number of 42 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54301012405063) 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, 21328373 + ... + 23738186.
It is an arithmetic number, because the mean of its divisors is an integer number (7404751273920).
Almost surely, 254301012405013 is an apocalyptic number.
It is an amenable number.
54301012405013 is a deficient number, since it is larger than the sum of its proper divisors (4936997786347).
54301012405013 is a wasteful number, since it uses less digits than its factorization.
54301012405013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45176107.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 54301012405013 its reverse (31050421010345), we get a palindrome (85351433415358).
The spelling of 54301012405013 in words is "fifty-four trillion, three hundred one billion, twelve million, four hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •