Base | Representation |
---|---|
bin | 101000010011011111011… |
… | …0010000001101111100001 |
3 | 201121120012021000200121212 |
4 | 1100212332302001233201 |
5 | 1211224204342124141 |
6 | 15440434350355505 |
7 | 1111131555651533 |
oct | 120467662015741 |
9 | 21546167020555 |
10 | 5539413629921 |
11 | 1846285644526 |
12 | 7556aa4bbb95 |
13 | 31249795b842 |
14 | 15217533b853 |
15 | 9915d6122eb |
hex | 509bec81be1 |
5539413629921 has 2 divisors, whose sum is σ = 5539413629922. Its totient is φ = 5539413629920.
The previous prime is 5539413629837. The next prime is 5539413629963. The reversal of 5539413629921 is 1299263149355.
5539413629921 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3196175206225 + 2343238423696 = 1787785^2 + 1530764^2 .
It is a cyclic number.
It is not a de Polignac number, because 5539413629921 - 238 = 5264535722977 is a prime.
It is a super-3 number, since 3×55394136299213 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5539413629521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2769706814960 + 2769706814961.
It is an arithmetic number, because the mean of its divisors is an integer number (2769706814961).
Almost surely, 25539413629921 is an apocalyptic number.
It is an amenable number.
5539413629921 is a deficient number, since it is larger than the sum of its proper divisors (1).
5539413629921 is an equidigital number, since it uses as much as digits as its factorization.
5539413629921 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15746400, while the sum is 59.
The spelling of 5539413629921 in words is "five trillion, five hundred thirty-nine billion, four hundred thirteen million, six hundred twenty-nine thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •