Base | Representation |
---|---|
bin | 1001010111100111010101… |
… | …1000111000100000101000 |
3 | 1100110210110101021121022220 |
4 | 2111321311120320200220 |
5 | 2322234031031024000 |
6 | 33524204035514040 |
7 | 2112146562022035 |
oct | 225716530704050 |
9 | 40423411247286 |
10 | 10301301033000 |
11 | 33118369736aa |
12 | 11a4564a58920 |
13 | 599540694333 |
14 | 27882ad8038c |
15 | 12ce619481a0 |
hex | 95e75638828 |
10301301033000 has 128 divisors (see below), whose sum is σ = 33248337408000. Its totient is φ = 2652288979200.
The previous prime is 10301301032989. The next prime is 10301301033041. The reversal of 10301301033000 is 33010310301.
It is a super-2 number, since 2×103013010330002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 59115880 + ... + 59289879.
It is an arithmetic number, because the mean of its divisors is an integer number (259752636000).
Almost surely, 210301301033000 is an apocalyptic number.
10301301033000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10301301033000 is an abundant number, since it is smaller than the sum of its proper divisors (22947036375000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301301033000 is a wasteful number, since it uses less digits than its factorization.
10301301033000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118405812 (or 118405798 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 10301301033000 its reverse (33010310301), we get a palindrome (10334311343301).
The spelling of 10301301033000 in words is "ten trillion, three hundred one billion, three hundred one million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •