Base | Representation |
---|---|
bin | 11101011001101011110… |
… | …11001001011011000101 |
3 | 10120120120002221102221211 |
4 | 32230311323021123011 |
5 | 113022413313341401 |
6 | 2052031203411421 |
7 | 132662146264411 |
oct | 16546573113305 |
9 | 3516502842854 |
10 | 1010222012101 |
11 | 35a483a97985 |
12 | 143955383b71 |
13 | 74356c79503 |
14 | 36c75c7bd41 |
15 | 1b428d7a951 |
hex | eb35ec96c5 |
1010222012101 has 4 divisors (see below), whose sum is σ = 1010227432032. Its totient is φ = 1010216592172.
The previous prime is 1010222012089. The next prime is 1010222012147. The reversal of 1010222012101 is 1012102220101.
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.
It is a cyclic number.
It is not a de Polignac number, because 1010222012101 - 223 = 1010213623493 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010222012161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2420041 + ... + 2806606.
It is an arithmetic number, because the mean of its divisors is an integer number (252556858008).
Almost surely, 21010222012101 is an apocalyptic number.
It is an amenable number.
1010222012101 is a deficient number, since it is larger than the sum of its proper divisors (5419931).
1010222012101 is an equidigital number, since it uses as much as digits as its factorization.
1010222012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5419930.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1010222012101 its reverse (1012102220101), we get a palindrome (2022324232202).
The spelling of 1010222012101 in words is "one trillion, ten billion, two hundred twenty-two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •