Base | Representation |
---|---|
bin | 101111000010111100… |
… | …0100010110000111101 |
3 | 100122202222121010012001 |
4 | 1132011320202300331 |
5 | 3123402243034442 |
6 | 114225052542301 |
7 | 10204425366514 |
oct | 1360570426075 |
9 | 318688533161 |
10 | 101030439997 |
11 | 3993505aa03 |
12 | 176b6a81991 |
13 | 96b1146c56 |
14 | 4c65c5367b |
15 | 29649302b7 |
hex | 1785e22c3d |
101030439997 has 4 divisors (see below), whose sum is σ = 101031673536. Its totient is φ = 101029206460.
The previous prime is 101030439977. The next prime is 101030440009. The reversal of 101030439997 is 799934030101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 799934030101 = 197 ⋅4060578833.
It is a cyclic number.
It is not a de Polignac number, because 101030439997 - 227 = 100896222269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101030439907) 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 in 3 ways as a sum of consecutive naturals, for example, 484453 + ... + 660874.
It is an arithmetic number, because the mean of its divisors is an integer number (25257918384).
Almost surely, 2101030439997 is an apocalyptic number.
It is an amenable number.
101030439997 is a deficient number, since it is larger than the sum of its proper divisors (1233539).
101030439997 is an equidigital number, since it uses as much as digits as its factorization.
101030439997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1233538.
The product of its (nonzero) digits is 183708, while the sum is 46.
The spelling of 101030439997 in words is "one hundred one billion, thirty million, four hundred thirty-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •