Base | Representation |
---|---|
bin | 101110101010001110… |
… | …0011111010010001001 |
3 | 100120122011212022022201 |
4 | 1131110130133102021 |
5 | 3120202424031441 |
6 | 114010503120201 |
7 | 10145034315343 |
oct | 1352434372211 |
9 | 316564768281 |
10 | 100201002121 |
11 | 39549942a60 |
12 | 17505143061 |
13 | 95ab357bcc |
14 | 4bc7a24293 |
15 | 2916be0c31 |
hex | 175471f489 |
100201002121 has 16 divisors (see below), whose sum is σ = 115588440576. Its totient is φ = 86003280000.
The previous prime is 100201002079. The next prime is 100201002127. The reversal of 100201002121 is 121200102001.
It is not a de Polignac number, because 100201002121 - 29 = 100201001609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100201002098 and 100201002107.
It is not an unprimeable number, because it can be changed into a prime (100201002127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3569490 + ... + 3597451.
It is an arithmetic number, because the mean of its divisors is an integer number (7224277536).
Almost surely, 2100201002121 is an apocalyptic number.
100201002121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100201002121 is a deficient number, since it is larger than the sum of its proper divisors (15387438455).
100201002121 is a wasteful number, since it uses less digits than its factorization.
100201002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7167024.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100201002121 its reverse (121200102001), we get a palindrome (221401104122).
The spelling of 100201002121 in words is "one hundred billion, two hundred one million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •