Base | Representation |
---|---|
bin | 10110100100111101… |
… | …01101100101101001 |
3 | 1011021202011210212102 |
4 | 23102132231211221 |
5 | 144311011413001 |
6 | 5322435223145 |
7 | 606242336300 |
oct | 132236554551 |
9 | 34252153772 |
10 | 12121201001 |
11 | 5160113798 |
12 | 2423447ab5 |
13 | 11b22bc2b0 |
14 | 82db6b437 |
15 | 4ae211e6b |
hex | 2d27ad969 |
12121201001 has 12 divisors (see below), whose sum is σ = 15184802052. Its totient is φ = 9590400288.
The previous prime is 12121200979. The next prime is 12121201007. The reversal of 12121201001 is 10010212121.
It can be written as a sum of positive squares in 2 ways, for example, as 733109776 + 11388091225 = 27076^2 + 106715^2 .
It is not a de Polignac number, because 12121201001 - 226 = 12054092137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12121201007) 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 11 ways as a sum of consecutive naturals, for example, 9513650 + ... + 9514923.
It is an arithmetic number, because the mean of its divisors is an integer number (1265400171).
Almost surely, 212121201001 is an apocalyptic number.
It is an amenable number.
12121201001 is a deficient number, since it is larger than the sum of its proper divisors (3063601051).
12121201001 is a wasteful number, since it uses less digits than its factorization.
12121201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19028600 (or 19028593 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 12121201001 its reverse (10010212121), we get a palindrome (22131413122).
It can be divided in two parts, 1212120 and 1001, that added together give a palindrome (1213121).
The spelling of 12121201001 in words is "twelve billion, one hundred twenty-one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •