Base | Representation |
---|---|
bin | 10010111011110111100… |
… | …010000011000001101000 |
3 | 11121101201011111102002210 |
4 | 102323313202003001220 |
5 | 132304411123133112 |
6 | 2433440031325120 |
7 | 163003524120030 |
oct | 22736742030150 |
9 | 4541634442083 |
10 | 1301233021032 |
11 | 46193913213a |
12 | 1902303807a0 |
13 | 959236b0999 |
14 | 46da12328c0 |
15 | 23cac2d4b3c |
hex | 12ef7883068 |
1301233021032 has 32 divisors (see below), whose sum is σ = 3717808632000. Its totient is φ = 371780863104.
The previous prime is 1301233021013. The next prime is 1301233021087. The reversal of 1301233021032 is 2301203321031.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 3872717157 + ... + 3872717492.
It is an arithmetic number, because the mean of its divisors is an integer number (116181519750).
Almost surely, 21301233021032 is an apocalyptic number.
1301233021032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1301233021032 is an abundant number, since it is smaller than the sum of its proper divisors (2416575610968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301233021032 is a wasteful number, since it uses less digits than its factorization.
1301233021032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7745434665 (or 7745434661 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1301233021032 its reverse (2301203321031), we get a palindrome (3602436342063).
The spelling of 1301233021032 in words is "one trillion, three hundred one billion, two hundred thirty-three million, twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •