Base | Representation |
---|---|
bin | 10110011000000110… |
… | …00100110110000001 |
3 | 1011000020010111211011 |
4 | 23030003010312001 |
5 | 144100400333204 |
6 | 5304022320521 |
7 | 603462206431 |
oct | 131403046601 |
9 | 34006114734 |
10 | 12013292929 |
11 | 5105210870 |
12 | 23b3289141 |
13 | 1195b3a171 |
14 | 81d6bc2c1 |
15 | 4a49e9304 |
hex | 2cc0c4d81 |
12013292929 has 16 divisors (see below), whose sum is σ = 13144936896. Its totient is φ = 10888300800.
The previous prime is 12013292911. The next prime is 12013292933. The reversal of 12013292929 is 92929231021.
It is a cyclic number.
It is not a de Polignac number, because 12013292929 - 27 = 12013292801 is a prime.
It is a super-2 number, since 2×120132929292 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12013292891 and 12013292900.
It is not an unprimeable number, because it can be changed into a prime (12013292959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8110869 + ... + 8112349.
It is an arithmetic number, because the mean of its divisors is an integer number (821558556).
Almost surely, 212013292929 is an apocalyptic number.
It is an amenable number.
12013292929 is a deficient number, since it is larger than the sum of its proper divisors (1131643967).
12013292929 is a wasteful number, since it uses less digits than its factorization.
12013292929 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3216.
The product of its (nonzero) digits is 34992, while the sum is 40.
The spelling of 12013292929 in words is "twelve billion, thirteen million, two hundred ninety-two thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •