Base | Representation |
---|---|
bin | 11101001001000100100… |
… | …00011101011001111100 |
3 | 10112201112110120222101221 |
4 | 32210202100131121330 |
5 | 112401131320320220 |
6 | 2043554123243124 |
7 | 132225125406304 |
oct | 16444220353174 |
9 | 3481473528357 |
10 | 1001302120060 |
11 | 356716a40a80 |
12 | 1420860794a4 |
13 | 73564c96798 |
14 | 3666b35a604 |
15 | 1b0a5c249aa |
hex | e92241d67c |
1001302120060 has 48 divisors (see below), whose sum is σ = 2294034462720. Its totient is φ = 364087269440.
The previous prime is 1001302120003. The next prime is 1001302120061. The reversal of 1001302120060 is 600212031001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001302120061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3642357 + ... + 3907603.
It is an arithmetic number, because the mean of its divisors is an integer number (47792384640).
Almost surely, 21001302120060 is an apocalyptic number.
1001302120060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001302120060 is an abundant number, since it is smaller than the sum of its proper divisors (1292732342660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001302120060 is a wasteful number, since it uses less digits than its factorization.
1001302120060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282426 (or 282424 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1001302120060 its reverse (600212031001), we get a palindrome (1601514151061).
The spelling of 1001302120060 in words is "one trillion, one billion, three hundred two million, one hundred twenty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •