Base | Representation |
---|---|
bin | 101110100100100110… |
… | …0110000110000010001 |
3 | 100120011000211202211102 |
4 | 1131021030300300101 |
5 | 3114311124030001 |
6 | 113540043154145 |
7 | 10140253531013 |
oct | 1351114606021 |
9 | 316130752742 |
10 | 100012330001 |
11 | 39462397891 |
12 | 17471b15955 |
13 | 957b2389bc |
14 | 4baa9501b3 |
15 | 2905372e6b |
hex | 1749330c11 |
100012330001 has 4 divisors (see below), whose sum is σ = 100013411904. Its totient is φ = 100011248100.
The previous prime is 100012329931. The next prime is 100012330009. The reversal of 100012330001 is 100033210001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 100033210001 = 359 ⋅278644039.
It is a cyclic number.
It is not a de Polignac number, because 100012330001 - 222 = 100008135697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100012330009) 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, 387845 + ... + 591986.
It is an arithmetic number, because the mean of its divisors is an integer number (25003352976).
Almost surely, 2100012330001 is an apocalyptic number.
It is an amenable number.
100012330001 is a deficient number, since it is larger than the sum of its proper divisors (1081903).
100012330001 is an equidigital number, since it uses as much as digits as its factorization.
100012330001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081902.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 100012330001 its reverse (100033210001), we get a palindrome (200045540002).
The spelling of 100012330001 in words is "one hundred billion, twelve million, three hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •