Base | Representation |
---|---|
bin | 101110001000101111… |
… | …0010101001010011011 |
3 | 100110201212121222201122 |
4 | 1130101132111022123 |
5 | 3110402304131413 |
6 | 113303204435455 |
7 | 10105142050031 |
oct | 1342136251233 |
9 | 313655558648 |
10 | 99077411483 |
11 | 39022685756 |
12 | 172509a8b8b |
13 | 945c63768b |
14 | 4b1c704551 |
15 | 289d24a108 |
hex | 171179529b |
99077411483 has 2 divisors, whose sum is σ = 99077411484. Its totient is φ = 99077411482.
The previous prime is 99077411453. The next prime is 99077411501. The reversal of 99077411483 is 38411477099.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (38411477099) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 99077411483 - 220 = 99076362907 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (99077411423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49538705741 + 49538705742.
It is an arithmetic number, because the mean of its divisors is an integer number (49538705742).
Almost surely, 299077411483 is an apocalyptic number.
99077411483 is a deficient number, since it is larger than the sum of its proper divisors (1).
99077411483 is an equidigital number, since it uses as much as digits as its factorization.
99077411483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1524096, while the sum is 53.
The spelling of 99077411483 in words is "ninety-nine billion, seventy-seven million, four hundred eleven thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •