Base | Representation |
---|---|
bin | 101111000010010111… |
… | …0011000101100100111 |
3 | 100122201122000110122222 |
4 | 1132010232120230213 |
5 | 3123332304000403 |
6 | 114223120142555 |
7 | 10204101222446 |
oct | 1360456305447 |
9 | 318648013588 |
10 | 101011000103 |
11 | 39925092482 |
12 | 176b0467a5b |
13 | 96aa0cb760 |
14 | 4c63432d5d |
15 | 2962d90338 |
hex | 1784b98b27 |
101011000103 has 4 divisors (see below), whose sum is σ = 108781077048. Its totient is φ = 93240923160.
The previous prime is 101010999997. The next prime is 101011000133. The reversal of 101011000103 is 301000110101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101011000103 - 228 = 100742564647 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 (101011000133) 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, 3885038453 + ... + 3885038478.
It is an arithmetic number, because the mean of its divisors is an integer number (27195269262).
Almost surely, 2101011000103 is an apocalyptic number.
101011000103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
101011000103 is a deficient number, since it is larger than the sum of its proper divisors (7770076945).
101011000103 is an equidigital number, since it uses as much as digits as its factorization.
101011000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7770076944.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 101011000103 its reverse (301000110101), we get a palindrome (402011110204).
The spelling of 101011000103 in words is "one hundred one billion, eleven million, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •