Base | Representation |
---|---|
bin | 1011001110001111… |
… | …0001111010000001 |
3 | 21202221112220122121 |
4 | 2303203301322001 |
5 | 22132200013441 |
6 | 1214532204241 |
7 | 134436560050 |
oct | 26343617201 |
9 | 7687486577 |
10 | 3012501121 |
11 | 1306529753 |
12 | 700a69681 |
13 | 390170656 |
14 | 20813c397 |
15 | 129712dd1 |
hex | b38f1e81 |
3012501121 has 16 divisors (see below), whose sum is σ = 3563481600. Its totient is φ = 2491771968.
The previous prime is 3012501109. The next prime is 3012501127. The reversal of 3012501121 is 1211052103.
3012501121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3012501121 - 211 = 3012499073 is a prime.
It is a super-3 number, since 3×30125011213 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3012501095 and 3012501104.
It is not an unprimeable number, because it can be changed into a prime (3012501127) 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, 611215 + ... + 616123.
It is an arithmetic number, because the mean of its divisors is an integer number (222717600).
Almost surely, 23012501121 is an apocalyptic number.
It is an amenable number.
3012501121 is a deficient number, since it is larger than the sum of its proper divisors (550980479).
3012501121 is a wasteful number, since it uses less digits than its factorization.
3012501121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7968.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 3012501121 is about 54886.2562122796. The cubic root of 3012501121 is about 1444.2500981585.
Adding to 3012501121 its reverse (1211052103), we get a palindrome (4223553224).
The spelling of 3012501121 in words is "three billion, twelve million, five hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •