Base | Representation |
---|---|
bin | 100110110001101… |
… | …1000010011010100 |
3 | 10100200021202101111 |
4 | 1031203120103110 |
5 | 10131041321322 |
6 | 333035304404 |
7 | 44146224250 |
oct | 11543302324 |
9 | 3320252344 |
10 | 1301120212 |
11 | 6084a2967 |
12 | 3038ab104 |
13 | 17973ab22 |
14 | c4b33260 |
15 | 79362177 |
hex | 4d8d84d4 |
1301120212 has 48 divisors (see below), whose sum is σ = 2730792960. Its totient is φ = 530351712.
The previous prime is 1301120167. The next prime is 1301120221. The reversal of 1301120212 is 2120211031.
It is a junction number, because it is equal to n+sod(n) for n = 1301120192 and 1301120201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109633 + ... + 120919.
It is an arithmetic number, because the mean of its divisors is an integer number (56891520).
Almost surely, 21301120212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1301120212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1365396480).
1301120212 is an abundant number, since it is smaller than the sum of its proper divisors (1429672748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301120212 is a wasteful number, since it uses less digits than its factorization.
1301120212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11500 (or 11498 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1301120212 is about 36071.0439549509. The cubic root of 1301120212 is about 1091.7062780362.
Adding to 1301120212 its reverse (2120211031), we get a palindrome (3421331243).
The spelling of 1301120212 in words is "one billion, three hundred one million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •