Base | Representation |
---|---|
bin | 1001010100000111110111… |
… | …1000101010100011000000 |
3 | 1100021001121210011121211102 |
4 | 2111001331320222203000 |
5 | 2320243202343240000 |
6 | 33440443354233532 |
7 | 2104624211006441 |
oct | 225017570524300 |
9 | 40231553147742 |
10 | 10241314040000 |
11 | 329935386aa2a |
12 | 1194a034258a8 |
13 | 5939a083c5c4 |
14 | 27597a1152c8 |
15 | 12b6004143d5 |
hex | 9507de2a8c0 |
10241314040000 has 140 divisors (see below), whose sum is σ = 26270827519200. Its totient is φ = 3955265664000.
The previous prime is 10241314039991. The next prime is 10241314040051. The reversal of 10241314040000 is 4041314201.
It is a super-2 number, since 2×102413140400002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 19 ways as a sum of consecutive naturals, for example, 3254360 + ... + 5574359.
Almost surely, 210241314040000 is an apocalyptic number.
10241314040000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10241314040000 is an abundant number, since it is smaller than the sum of its proper divisors (16029513479200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10241314040000 is an frugal number, since it uses more digits than its factorization.
10241314040000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8828780 (or 8828755 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10241314040000 its reverse (4041314201), we get a palindrome (10245355354201).
The spelling of 10241314040000 in words is "ten trillion, two hundred forty-one billion, three hundred fourteen million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •