Base | Representation |
---|---|
bin | 11000100110101101000111… |
… | …10101010000000101100111 |
3 | 21002120112012122110021111010 |
4 | 30103112203311100011213 |
5 | 24042440003112022242 |
6 | 311024054420113303 |
7 | 14253030211630305 |
oct | 1423264365200547 |
9 | 232515178407433 |
10 | 54106451673447 |
11 | 16270465465588 |
12 | 609a239235833 |
13 | 24262a785b4a4 |
14 | d50aa278d275 |
15 | 63c67645b89c |
hex | 3135a3d50167 |
54106451673447 has 16 divisors (see below), whose sum is σ = 75942656012160. Its totient is φ = 34170796382112.
The previous prime is 54106451673413. The next prime is 54106451673473. The reversal of 54106451673447 is 74437615460145.
It is not a de Polignac number, because 54106451673447 - 28 = 54106451673191 is a prime.
It is a super-2 number, since 2×541064516734472 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54106451673247) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22446213 + ... + 24739550.
It is an arithmetic number, because the mean of its divisors is an integer number (4746416000760).
Almost surely, 254106451673447 is an apocalyptic number.
54106451673447 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
54106451673447 is a deficient number, since it is larger than the sum of its proper divisors (21836204338713).
54106451673447 is a wasteful number, since it uses less digits than its factorization.
54106451673447 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47205902.
The product of its (nonzero) digits is 33868800, while the sum is 57.
The spelling of 54106451673447 in words is "fifty-four trillion, one hundred six billion, four hundred fifty-one million, six hundred seventy-three thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •