Base | Representation |
---|---|
bin | 101110100100001000… |
… | …0000011010111111001 |
3 | 100120002220220020012202 |
4 | 1131020100003113321 |
5 | 3114243040243411 |
6 | 113534314115545 |
7 | 10140001336004 |
oct | 1351020032771 |
9 | 316086806182 |
10 | 99996415481 |
11 | 39454407a96 |
12 | 1746871bbb5 |
13 | 9577b56021 |
14 | 4ba87aa53b |
15 | 2903c7c83b |
hex | 17484035f9 |
99996415481 has 2 divisors, whose sum is σ = 99996415482. Its totient is φ = 99996415480.
The previous prime is 99996415447. The next prime is 99996415529. The reversal of 99996415481 is 18451469999.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97397047225 + 2599368256 = 312085^2 + 50984^2 .
It is a cyclic number.
It is not a de Polignac number, because 99996415481 - 218 = 99996153337 is a prime.
It is a super-2 number, since 2×999964154812 (a number of 23 digits) contains 22 as substring.
It is a weakly prime.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49998207740 + 49998207741.
It is an arithmetic number, because the mean of its divisors is an integer number (49998207741).
Almost surely, 299996415481 is an apocalyptic number.
It is an amenable number.
99996415481 is a deficient number, since it is larger than the sum of its proper divisors (1).
99996415481 is an equidigital number, since it uses as much as digits as its factorization.
99996415481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25194240, while the sum is 65.
The spelling of 99996415481 in words is "ninety-nine billion, nine hundred ninety-six million, four hundred fifteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •