Base | Representation |
---|---|
bin | 101110110011010110… |
… | …0000000011100100001 |
3 | 100121102111202122210202 |
4 | 1131212230000130201 |
5 | 3121314301410001 |
6 | 114101115034545 |
7 | 10155441625355 |
oct | 1354654003441 |
9 | 317374678722 |
10 | 100507060001 |
11 | 39696684857 |
12 | 1758b73ba55 |
13 | 962989714a |
14 | 4c16533465 |
15 | 29339e996b |
hex | 1766b00721 |
100507060001 has 4 divisors (see below), whose sum is σ = 101636352900. Its totient is φ = 99377767104.
The previous prime is 100507059953. The next prime is 100507060067. The reversal of 100507060001 is 100060705001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 20034987025 + 80472072976 = 141545^2 + 283676^2 .
It is a cyclic number.
It is not a de Polignac number, because 100507060001 - 226 = 100439951137 is a prime.
It is a super-2 number, since 2×1005070600012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100507060081) 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, 564646316 + ... + 564646493.
It is an arithmetic number, because the mean of its divisors is an integer number (25409088225).
Almost surely, 2100507060001 is an apocalyptic number.
It is an amenable number.
100507060001 is a deficient number, since it is larger than the sum of its proper divisors (1129292899).
100507060001 is an equidigital number, since it uses as much as digits as its factorization.
100507060001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1129292898.
The product of its (nonzero) digits is 210, while the sum is 20.
Adding to 100507060001 its reverse (100060705001), we get a palindrome (200567765002).
The spelling of 100507060001 in words is "one hundred billion, five hundred seven million, sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •