Base | Representation |
---|---|
bin | 11101011101011000110… |
… | …10101110010001111101 |
3 | 10120202200122200202002002 |
4 | 32232230122232101331 |
5 | 113041001230013041 |
6 | 2053000341112045 |
7 | 133062336022442 |
oct | 16565432562175 |
9 | 3522618622062 |
10 | 1012210001021 |
11 | 36030418042a |
12 | 14420b0b8625 |
13 | 745b2aa980b |
14 | 36dc3ccb9c9 |
15 | 1b4e366959b |
hex | ebac6ae47d |
1012210001021 has 4 divisors (see below), whose sum is σ = 1013458102944. Its totient is φ = 1010961899100.
The previous prime is 1012210001003. The next prime is 1012210001029. The reversal of 1012210001021 is 1201000122101.
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 1012210001021 - 238 = 737332094077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012210000993 and 1012210001011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012210001029) 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, 624049745 + ... + 624051366.
It is an arithmetic number, because the mean of its divisors is an integer number (253364525736).
Almost surely, 21012210001021 is an apocalyptic number.
It is an amenable number.
1012210001021 is a deficient number, since it is larger than the sum of its proper divisors (1248101923).
1012210001021 is an equidigital number, since it uses as much as digits as its factorization.
1012210001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1248101922.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1012210001021 its reverse (1201000122101), we get a palindrome (2213210123122).
The spelling of 1012210001021 in words is "one trillion, twelve billion, two hundred ten million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •