Base | Representation |
---|---|
bin | 1011001011100010… |
… | …1101100010010101 |
3 | 21202011022022120001 |
4 | 2302320231202111 |
5 | 22121302223104 |
6 | 1213450211301 |
7 | 134241605245 |
oct | 26270554225 |
9 | 7664268501 |
10 | 3001211029 |
11 | 13001182a3 |
12 | 6b9123b31 |
13 | 38aa1981b |
14 | 20683db25 |
15 | 128732aa4 |
hex | b2e2d895 |
3001211029 has 16 divisors (see below), whose sum is σ = 3178022400. Its totient is φ = 2829600000.
The previous prime is 3001211009. The next prime is 3001211053. The reversal of 3001211029 is 9201121003.
3001211029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3001211029 - 229 = 2464340117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3001210997 and 3001211015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3001211009) 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, 1332154 + ... + 1334404.
It is an arithmetic number, because the mean of its divisors is an integer number (198626400).
Almost surely, 23001211029 is an apocalyptic number.
It is an amenable number.
3001211029 is a deficient number, since it is larger than the sum of its proper divisors (176811371).
3001211029 is a wasteful number, since it uses less digits than its factorization.
3001211029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3372.
The product of its (nonzero) digits is 108, while the sum is 19.
The square root of 3001211029 is about 54783.3097667529. The cubic root of 3001211029 is about 1442.4436115392.
It can be divided in two parts, 30012 and 11029, that added together give a triangular number (41041 = T286).
The spelling of 3001211029 in words is "three billion, one million, two hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •