Base | Representation |
---|---|
bin | 11101101111110110001… |
… | …11001000101111110001 |
3 | 10121201021022111002000012 |
4 | 32313323013020233301 |
5 | 113221300232414301 |
6 | 2101315555104305 |
7 | 133563043234361 |
oct | 16677307105761 |
9 | 3551238432005 |
10 | 1022120201201 |
11 | 36452a230510 |
12 | 146115ba2095 |
13 | 75501cb51a8 |
14 | 376841569a1 |
15 | 1b8c36d9ebb |
hex | edfb1c8bf1 |
1022120201201 has 4 divisors (see below), whose sum is σ = 1115040219504. Its totient is φ = 929200182900.
The previous prime is 1022120201173. The next prime is 1022120201231. The reversal of 1022120201201 is 1021020212201.
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 not a de Polignac number, because 1022120201201 - 210 = 1022120200177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1022120201231) 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, 46460009135 + ... + 46460009156.
It is an arithmetic number, because the mean of its divisors is an integer number (278760054876).
Almost surely, 21022120201201 is an apocalyptic number.
1022120201201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1022120201201 is a deficient number, since it is larger than the sum of its proper divisors (92920018303).
1022120201201 is an equidigital number, since it uses as much as digits as its factorization.
1022120201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92920018302.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1022120201201 its reverse (1021020212201), we get a palindrome (2043140413402).
The spelling of 1022120201201 in words is "one trillion, twenty-two billion, one hundred twenty million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •