Base | Representation |
---|---|
bin | 10110110010000110100111… |
… | …011111100000000000001011 |
3 | 111010210000222101201111000202 |
4 | 112302012213133200000023 |
5 | 101113134302114213003 |
6 | 553035142541122415 |
7 | 30051134640011642 |
oct | 2662064737400013 |
9 | 433700871644022 |
10 | 100200102101003 |
11 | 29a21696474373 |
12 | b2a354b55940b |
13 | 43baaa1662cc8 |
14 | 1aa59d46b0359 |
15 | b8b67bbb1088 |
hex | 5b21a77e000b |
100200102101003 has 4 divisors (see below), whose sum is σ = 100201067514408. Its totient is φ = 100199136687600.
The previous prime is 100200102100999. The next prime is 100200102101041. The reversal of 100200102101003 is 300101201002001.
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 100200102101003 - 22 = 100200102100999 is a prime.
It is a super-2 number, since 2×1002001021010032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100200102101303) 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, 482551001 + ... + 482758602.
It is an arithmetic number, because the mean of its divisors is an integer number (25050266878602).
Almost surely, 2100200102101003 is an apocalyptic number.
100200102101003 is a deficient number, since it is larger than the sum of its proper divisors (965413405).
100200102101003 is an equidigital number, since it uses as much as digits as its factorization.
100200102101003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965413404.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 100200102101003 its reverse (300101201002001), we get a palindrome (400301303103004).
The spelling of 100200102101003 in words is "one hundred trillion, two hundred billion, one hundred two million, one hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •