Base | Representation |
---|---|
bin | 101111000010000010… |
… | …0011011011010111011 |
3 | 100122200212022200000121 |
4 | 1132010010123122323 |
5 | 3123322000014321 |
6 | 114222044314111 |
7 | 10203605562634 |
oct | 1360404333273 |
9 | 318625280017 |
10 | 101000001211 |
11 | 3991995a88a |
12 | 176a8842937 |
13 | 96a7a4a335 |
14 | 4c61bac88b |
15 | 2961e1b441 |
hex | 178411b6bb |
101000001211 has 8 divisors (see below), whose sum is σ = 101605510544. Its totient is φ = 100396225440.
The previous prime is 101000001209. The next prime is 101000001217. The reversal of 101000001211 is 112100000101.
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 101000001211 - 21 = 101000001209 is a prime.
It is a super-3 number, since 3×1010000012113 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101000001194 and 101000001203.
It is not an unprimeable number, because it can be changed into a prime (101000001217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 316425 + ... + 549658.
It is an arithmetic number, because the mean of its divisors is an integer number (12700688818).
Almost surely, 2101000001211 is an apocalyptic number.
101000001211 is a deficient number, since it is larger than the sum of its proper divisors (605509333).
101000001211 is an equidigital number, since it uses as much as digits as its factorization.
101000001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 866781.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101000001211 its reverse (112100000101), we get a palindrome (213100001312).
The spelling of 101000001211 in words is "one hundred one billion, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •