Base | Representation |
---|---|
bin | 1011000000011011111010… |
… | …0100000111000111011001 |
3 | 1120211221200112220010022111 |
4 | 2300012332210013013121 |
5 | 3041240120210311301 |
6 | 41423345344152321 |
7 | 2356230546535534 |
oct | 260067644070731 |
9 | 46757615803274 |
10 | 12102120010201 |
11 | 3946531275a51 |
12 | 143557b6086a1 |
13 | 69a2c04a5120 |
14 | 2dba62417a1b |
15 | 15ec0d326551 |
hex | b01be9071d9 |
12102120010201 has 16 divisors (see below), whose sum is σ = 13681498360320. Its totient is φ = 10627592434560.
The previous prime is 12102120010199. The next prime is 12102120010229. The reversal of 12102120010201 is 10201002120121.
It is a cyclic number.
It is not a de Polignac number, because 12102120010201 - 21 = 12102120010199 is a prime.
It is a super-2 number, since 2×121021200102012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12102120010291) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 254468380 + ... + 254515933.
It is an arithmetic number, because the mean of its divisors is an integer number (855093647520).
Almost surely, 212102120010201 is an apocalyptic number.
It is an amenable number.
12102120010201 is a deficient number, since it is larger than the sum of its proper divisors (1579378350119).
12102120010201 is a wasteful number, since it uses less digits than its factorization.
12102120010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508984416.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12102120010201 its reverse (10201002120121), we get a palindrome (22303122130322).
The spelling of 12102120010201 in words is "twelve trillion, one hundred two billion, one hundred twenty million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •