Base | Representation |
---|---|
bin | 101110100100100001… |
… | …1111010010111110111 |
3 | 100120010212110220112021 |
4 | 1131021003322113313 |
5 | 3114310030310403 |
6 | 113535521334011 |
7 | 10140225026323 |
oct | 1351103722767 |
9 | 316125426467 |
10 | 100010010103 |
11 | 39461052913 |
12 | 17471197307 |
13 | 957a905a93 |
14 | 4baa508983 |
15 | 29050658bd |
hex | 17490fa5f7 |
100010010103 has 4 divisors (see below), whose sum is σ = 101705095080. Its totient is φ = 98314925128.
The previous prime is 100010010097. The next prime is 100010010109. The reversal of 100010010103 is 301010010001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301010010001 = 41 ⋅7341707561.
It is an interprime number because it is at equal distance from previous prime (100010010097) and next prime (100010010109).
It is a cyclic number.
It is not a de Polignac number, because 100010010103 - 213 = 100010001911 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 (100010010109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 847542400 + ... + 847542517.
It is an arithmetic number, because the mean of its divisors is an integer number (25426273770).
Almost surely, 2100010010103 is an apocalyptic number.
100010010103 is a deficient number, since it is larger than the sum of its proper divisors (1695084977).
100010010103 is an equidigital number, since it uses as much as digits as its factorization.
100010010103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1695084976.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 100010010103 its reverse (301010010001), we get a palindrome (401020020104).
The spelling of 100010010103 in words is "one hundred billion, ten million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •