Base | Representation |
---|---|
bin | 101111011111110011… |
… | …1101010101000010101 |
3 | 100202021111021212002002 |
4 | 1132333213222220111 |
5 | 3132343232004133 |
6 | 114505134325045 |
7 | 10240426665515 |
oct | 1367747525025 |
9 | 322244255062 |
10 | 101999094293 |
11 | 3a291914248 |
12 | 17927359785 |
13 | 9806a2a785 |
14 | 4d18761845 |
15 | 29be9bdce8 |
hex | 17bf9eaa15 |
101999094293 has 2 divisors, whose sum is σ = 101999094294. Its totient is φ = 101999094292.
The previous prime is 101999094287. The next prime is 101999094343. The reversal of 101999094293 is 392490999101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97789420369 + 4209673924 = 312713^2 + 64882^2 .
It is a cyclic number.
It is not a de Polignac number, because 101999094293 - 224 = 101982317077 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101999094203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50999547146 + 50999547147.
It is an arithmetic number, because the mean of its divisors is an integer number (50999547147).
Almost surely, 2101999094293 is an apocalyptic number.
It is an amenable number.
101999094293 is a deficient number, since it is larger than the sum of its proper divisors (1).
101999094293 is an equidigital number, since it uses as much as digits as its factorization.
101999094293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1417176, while the sum is 56.
The spelling of 101999094293 in words is "one hundred one billion, nine hundred ninety-nine million, ninety-four thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •