Base | Representation |
---|---|
bin | 10110110011100011101001… |
… | …111100010100111101001001 |
3 | 111011010120211112111121212002 |
4 | 112303203221330110331021 |
5 | 101121303400301430433 |
6 | 553153103501400345 |
7 | 30061302350242145 |
oct | 2663435174247511 |
9 | 434116745447762 |
10 | 100300001201993 |
11 | 29a5aa9a95455a |
12 | b2ba98b5690b5 |
13 | 43c73322a5998 |
14 | 1aaa790188225 |
15 | b8e0771199e8 |
hex | 5b38e9f14f49 |
100300001201993 has 2 divisors, whose sum is σ = 100300001201994. Its totient is φ = 100300001201992.
The previous prime is 100300001201903. The next prime is 100300001202001. The reversal of 100300001201993 is 399102100003001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61064347239424 + 39235653962569 = 7814368^2 + 6263837^2 .
It is a cyclic number.
It is not a de Polignac number, because 100300001201993 - 228 = 100299732766537 is a prime.
It is a super-2 number, since 2×1003000012019932 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100300001201903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50150000600996 + 50150000600997.
It is an arithmetic number, because the mean of its divisors is an integer number (50150000600997).
Almost surely, 2100300001201993 is an apocalyptic number.
It is an amenable number.
100300001201993 is a deficient number, since it is larger than the sum of its proper divisors (1).
100300001201993 is an equidigital number, since it uses as much as digits as its factorization.
100300001201993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 29.
Adding to 100300001201993 its reverse (399102100003001), we get a palindrome (499402101204994).
The spelling of 100300001201993 in words is "one hundred trillion, three hundred billion, one million, two hundred one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •