Base | Representation |
---|---|
bin | 11101000110110101011… |
… | …10010111110110110111 |
3 | 10112121102211100200001201 |
4 | 32203122232113312313 |
5 | 112341202103031403 |
6 | 2043235052433331 |
7 | 132153313520161 |
oct | 16433256276667 |
9 | 3477384320051 |
10 | 1000102002103 |
11 | 356160564656 |
12 | 1419b0178847 |
13 | 73403460709 |
14 | 36595bd9931 |
15 | 1b0356b421d |
hex | e8dab97db7 |
1000102002103 has 8 divisors (see below), whose sum is σ = 1004048893008. Its totient is φ = 996155541504.
The previous prime is 1000102002091. The next prime is 1000102002113. The reversal of 1000102002103 is 3012002010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000102002103 - 217 = 1000101871031 is a prime.
It is a super-2 number, since 2×10001020021032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1000102002103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000102002113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5033025 + ... + 5227957.
It is an arithmetic number, because the mean of its divisors is an integer number (125506111626).
Almost surely, 21000102002103 is an apocalyptic number.
1000102002103 is a deficient number, since it is larger than the sum of its proper divisors (3946890905).
1000102002103 is a wasteful number, since it uses less digits than its factorization.
1000102002103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 215153.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 1000102002103 its reverse (3012002010001), we get a palindrome (4012104012104).
The spelling of 1000102002103 in words is "one trillion, one hundred two million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •