Base | Representation |
---|---|
bin | 1110001101011101000100010… |
… | …1000100000111000010001101 |
3 | 11212010112210210020020102111001 |
4 | 3203113101011010013002031 |
5 | 2022031232222301410023 |
6 | 13502421104533500301 |
7 | 420424253045215534 |
oct | 34327210504070215 |
9 | 4763483706212431 |
10 | 999955444560013 |
11 | 26a6867a4740067 |
12 | 9419a0931a1691 |
13 | 33bc651728a0b6 |
14 | 138d015d2cb31b |
15 | 7a912089246ad |
hex | 38d744510708d |
999955444560013 has 2 divisors, whose sum is σ = 999955444560014. Its totient is φ = 999955444560012.
The previous prime is 999955444559999. The next prime is 999955444560071. The reversal of 999955444560013 is 310065444559999.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 920273078016009 + 79682366544004 = 30336003^2 + 8926498^2 .
It is a cyclic number.
It is not a de Polignac number, because 999955444560013 - 29 = 999955444559501 is a prime.
It is a super-2 number, since 2×9999554445600132 (a number of 31 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (999955444560613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 499977722280006 + 499977722280007.
It is an arithmetic number, because the mean of its divisors is an integer number (499977722280007).
Almost surely, 2999955444560013 is an apocalyptic number.
It is an amenable number.
999955444560013 is a deficient number, since it is larger than the sum of its proper divisors (1).
999955444560013 is an equidigital number, since it uses as much as digits as its factorization.
999955444560013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 944784000, while the sum is 73.
The spelling of 999955444560013 in words is "nine hundred ninety-nine trillion, nine hundred fifty-five billion, four hundred forty-four million, five hundred sixty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •