Base | Representation |
---|---|
bin | 10010111011101011100… |
… | …111011101000111000000 |
3 | 11121101012020022222110120 |
4 | 102323223213131013000 |
5 | 132304003434041000 |
6 | 2433404130500240 |
7 | 162665545661616 |
oct | 22735347350700 |
9 | 4541166288416 |
10 | 1301033112000 |
11 | 461846301566 |
12 | 190195434680 |
13 | 958c1158c0b |
14 | 46d828756b6 |
15 | 23c999976a0 |
hex | 12eeb9dd1c0 |
1301033112000 has 224 divisors, whose sum is σ = 4395922063104. Its totient is φ = 338873472000.
The previous prime is 1301033111999. The next prime is 1301033112037. The reversal of 1301033112000 is 2113301031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 401655 + ... + 1662345.
Almost surely, 21301033112000 is an apocalyptic number.
1301033112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1301033112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2197961031552).
1301033112000 is an abundant number, since it is smaller than the sum of its proper divisors (3094888951104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301033112000 is a wasteful number, since it uses less digits than its factorization.
1301033112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1260764 (or 1260744 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1301033112000 its reverse (2113301031), we get a palindrome (1303146413031).
The spelling of 1301033112000 in words is "one trillion, three hundred one billion, thirty-three million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •