Base | Representation |
---|---|
bin | 10110100001010111… |
… | …00111011010000001 |
3 | 1011012122101220211101 |
4 | 23100223213122001 |
5 | 144230300412441 |
6 | 5315440414401 |
7 | 605425023523 |
oct | 132053473201 |
9 | 34178356741 |
10 | 12091029121 |
11 | 5145086156 |
12 | 2415317401 |
13 | 11a8c87002 |
14 | 829b55a13 |
15 | 4ab752231 |
hex | 2d0ae7681 |
12091029121 has 4 divisors (see below), whose sum is σ = 12091980100. Its totient is φ = 12090078144.
The previous prime is 12091029113. The next prime is 12091029143. The reversal of 12091029121 is 12192019021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8402288896 + 3688740225 = 91664^2 + 60735^2 .
It is a cyclic number.
It is not a de Polignac number, because 12091029121 - 23 = 12091029113 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 12091029121.
It is not an unprimeable number, because it can be changed into a prime (12091029101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 456156 + ... + 481933.
It is an arithmetic number, because the mean of its divisors is an integer number (3022995025).
Almost surely, 212091029121 is an apocalyptic number.
It is an amenable number.
12091029121 is a deficient number, since it is larger than the sum of its proper divisors (950979).
12091029121 is an equidigital number, since it uses as much as digits as its factorization.
12091029121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 950978.
The product of its (nonzero) digits is 648, while the sum is 28.
It can be divided in two parts, 1209 and 1029121, that added together give a triangular number (1030330 = T1435).
The spelling of 12091029121 in words is "twelve billion, ninety-one million, twenty-nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •