Base | Representation |
---|---|
bin | 11101001000100011000… |
… | …00100001111011001001 |
3 | 10112200210212211201001202 |
4 | 32210101200201323021 |
5 | 112400042401321301 |
6 | 2043510204353545 |
7 | 132215144062604 |
oct | 16442140417311 |
9 | 3480725751052 |
10 | 1001021120201 |
11 | 356592364693 |
12 | 142007b458b5 |
13 | 7351b9bbc8b |
14 | 36641cd133b |
15 | 1b08b21a66b |
hex | e911821ec9 |
1001021120201 has 4 divisors (see below), whose sum is σ = 1001135780304. Its totient is φ = 1000906460100.
The previous prime is 1001021120189. The next prime is 1001021120251. The reversal of 1001021120201 is 1020211201001.
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 1001021120201 - 234 = 983841251017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001021120251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57316955 + ... + 57334416.
It is an arithmetic number, because the mean of its divisors is an integer number (250283945076).
Almost surely, 21001021120201 is an apocalyptic number.
It is an amenable number.
1001021120201 is a deficient number, since it is larger than the sum of its proper divisors (114660103).
1001021120201 is an equidigital number, since it uses as much as digits as its factorization.
1001021120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114660102.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1001021120201 its reverse (1020211201001), we get a palindrome (2021232321202).
The spelling of 1001021120201 in words is "one trillion, one billion, twenty-one million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •