Base | Representation |
---|---|
bin | 101100011011110001010… |
… | …111000100010111100001 |
3 | 101210220120000001110210012 |
4 | 230123301113010113201 |
5 | 400012004342331132 |
6 | 10254425250414305 |
7 | 433414661626250 |
oct | 54336127042741 |
9 | 11726500043705 |
10 | 3053476136417 |
11 | a77a76747543 |
12 | 41394ab91395 |
13 | 191c31802385 |
14 | a7b09172797 |
15 | 546643800b2 |
hex | 2c6f15c45e1 |
3053476136417 has 16 divisors (see below), whose sum is σ = 3610615578624. Its totient is φ = 2526960618000.
The previous prime is 3053476136413. The next prime is 3053476136467. The reversal of 3053476136417 is 7146316743503.
3053476136417 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3053476136417 - 22 = 3053476136413 is a prime.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3053476136411) 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, 16230509 + ... + 16417562.
It is an arithmetic number, because the mean of its divisors is an integer number (225663473664).
Almost surely, 23053476136417 is an apocalyptic number.
It is an amenable number.
3053476136417 is a deficient number, since it is larger than the sum of its proper divisors (557139442207).
3053476136417 is a wasteful number, since it uses less digits than its factorization.
3053476136417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32648540.
The product of its (nonzero) digits is 3810240, while the sum is 50.
The spelling of 3053476136417 in words is "three trillion, fifty-three billion, four hundred seventy-six million, one hundred thirty-six thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •