Base | Representation |
---|---|
bin | 10110010111101110… |
… | …10001111110101001 |
3 | 1011000000022102111022 |
4 | 23023313101332221 |
5 | 144044102413001 |
6 | 5303432142225 |
7 | 603424011161 |
oct | 131367217651 |
9 | 34000272438 |
10 | 12010201001 |
11 | 5103499857 |
12 | 23b2237975 |
13 | 11952c6a16 |
14 | 81d1155a1 |
15 | 4a45d811b |
hex | 2cbdd1fa9 |
12010201001 has 6 divisors (see below), whose sum is σ = 12210321006. Its totient is φ = 11813308800.
The previous prime is 12010200997. The next prime is 12010201003. The reversal of 12010201001 is 10010201021.
It can be written as a sum of positive squares in 3 ways, for example, as 859896976 + 11150304025 = 29324^2 + 105595^2 .
It is not a de Polignac number, because 12010201001 - 22 = 12010200997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12010201001.
It is not an unprimeable number, because it can be changed into a prime (12010201003) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1610120 + ... + 1617561.
It is an arithmetic number, because the mean of its divisors is an integer number (2035053501).
Almost surely, 212010201001 is an apocalyptic number.
It is an amenable number.
12010201001 is a deficient number, since it is larger than the sum of its proper divisors (200120005).
12010201001 is an frugal number, since it uses more digits than its factorization.
12010201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3227803 (or 3227742 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 12010201001 its reverse (10010201021), we get a palindrome (22020402022).
It can be divided in two parts, 1201020 and 1001, that added together give a palindrome (1202021).
The spelling of 12010201001 in words is "twelve billion, ten million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •