Base | Representation |
---|---|
bin | 11101101101110011010… |
… | …10101000011111010001 |
3 | 10121121102210102100020110 |
4 | 32312321222220133101 |
5 | 113212023141210001 |
6 | 2101015013231533 |
7 | 133523611406013 |
oct | 16667152503721 |
9 | 3547383370213 |
10 | 1021022210001 |
11 | 364016468472 |
12 | 145a6a3325a9 |
13 | 75388688961 |
14 | 375bc3bc1b3 |
15 | 1b85c0ee3d6 |
hex | edb9aa87d1 |
1021022210001 has 8 divisors (see below), whose sum is σ = 1366386427264. Its totient is φ = 678169733040.
The previous prime is 1021022209967. The next prime is 1021022210029. The reversal of 1021022210001 is 1000122201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1021022210001 - 27 = 1021022209873 is a prime.
It is a super-2 number, since 2×10210222100012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1021022210081) 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 7 ways as a sum of consecutive naturals, for example, 627934126 + ... + 627935751.
It is an arithmetic number, because the mean of its divisors is an integer number (170798303408).
Almost surely, 21021022210001 is an apocalyptic number.
It is an amenable number.
1021022210001 is a deficient number, since it is larger than the sum of its proper divisors (345364217263).
1021022210001 is a wasteful number, since it uses less digits than its factorization.
1021022210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255870151.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1021022210001 its reverse (1000122201201), we get a palindrome (2021144411202).
The spelling of 1021022210001 in words is "one trillion, twenty-one billion, twenty-two million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •