Base | Representation |
---|---|
bin | 10010111011111100110… |
… | …001110100000010100000 |
3 | 11121101221022010020110202 |
4 | 102323330301310002200 |
5 | 132310101141240112 |
6 | 2433452454044332 |
7 | 163005643222136 |
oct | 22737461640240 |
9 | 4541838106422 |
10 | 1301321040032 |
11 | 461983890112 |
12 | 1902559496a8 |
13 | 959389bb030 |
14 | 46dacbc5756 |
15 | 23cb4dbe6c2 |
hex | 12efcc740a0 |
1301321040032 has 48 divisors (see below), whose sum is σ = 2759204858760. Its totient is φ = 600576187392.
The previous prime is 1301321039989. The next prime is 1301321040049. The reversal of 1301321040032 is 2300401231031.
It can be written as a sum of positive squares in 4 ways, for example, as 1167186372496 + 134134667536 = 1080364^2 + 366244^2 .
It is a super-2 number, since 2×13013210400322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1301321039986 and 1301321040013.
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, 8354738 + ... + 8509070.
Almost surely, 21301321040032 is an apocalyptic number.
It is an amenable number.
1301321040032 is an abundant number, since it is smaller than the sum of its proper divisors (1457883818728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301321040032 is a wasteful number, since it uses less digits than its factorization.
1301321040032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174625 (or 174617 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1301321040032 its reverse (2300401231031), we get a palindrome (3601722271063).
The spelling of 1301321040032 in words is "one trillion, three hundred one billion, three hundred twenty-one million, forty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •