Base | Representation |
---|---|
bin | 10110101111101000010100… |
… | …011111111001100001000011 |
3 | 111010011210020220102102102001 |
4 | 112233220110133321201003 |
5 | 101102343202322331321 |
6 | 552425113001004431 |
7 | 30032636632651021 |
oct | 2657502437714103 |
9 | 433153226372361 |
10 | 100030132230211 |
11 | 299665a4955777 |
12 | b276614a83717 |
13 | 43a7a54a27971 |
14 | 1a9b6aca3b711 |
15 | b8702ed17c91 |
hex | 5afa147f9843 |
100030132230211 has 8 divisors (see below), whose sum is σ = 102745558031760. Its totient is φ = 97315333203168.
The previous prime is 100030132230199. The next prime is 100030132230233. The reversal of 100030132230211 is 112032231030001.
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 100030132230211 - 213 = 100030132222019 is a prime.
It is a super-2 number, since 2×1000301322302112 (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 (100030132230011) 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, 156370096 + ... + 157008493.
It is an arithmetic number, because the mean of its divisors is an integer number (12843194753970).
Almost surely, 2100030132230211 is an apocalyptic number.
100030132230211 is a deficient number, since it is larger than the sum of its proper divisors (2715425801549).
100030132230211 is an equidigital number, since it uses as much as digits as its factorization.
100030132230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313387253.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 100030132230211 its reverse (112032231030001), we get a palindrome (212062363260212).
The spelling of 100030132230211 in words is "one hundred trillion, thirty billion, one hundred thirty-two million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •