Base | Representation |
---|---|
bin | 1011000001100110000000… |
… | …1010001110010011110101 |
3 | 1120220212000210022012120012 |
4 | 2300121200022032103311 |
5 | 3042101334304031401 |
6 | 41440435221150005 |
7 | 2360533506301550 |
oct | 260314012162365 |
9 | 46825023265505 |
10 | 12122011002101 |
11 | 3953a09210630 |
12 | 14393b0b5b305 |
13 | 69c140404010 |
14 | 2dc9cc045697 |
15 | 1604c470d8bb |
hex | b066028e4f5 |
12122011002101 has 64 divisors (see below), whose sum is σ = 17191446429696. Its totient is φ = 8241636211200.
The previous prime is 12122011002061. The next prime is 12122011002113. The reversal of 12122011002101 is 10120011022121.
It is not a de Polignac number, because 12122011002101 - 226 = 12121943893237 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122011002131) 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 63 ways as a sum of consecutive naturals, for example, 3208016 + ... + 5876681.
It is an arithmetic number, because the mean of its divisors is an integer number (268616350464).
Almost surely, 212122011002101 is an apocalyptic number.
12122011002101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12122011002101 is a deficient number, since it is larger than the sum of its proper divisors (5069435427595).
12122011002101 is a wasteful number, since it uses less digits than its factorization.
12122011002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9084802.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12122011002101 its reverse (10120011022121), we get a palindrome (22242022024222).
The spelling of 12122011002101 in words is "twelve trillion, one hundred twenty-two billion, eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •