Base | Representation |
---|---|
bin | 1001010100000011100010… |
… | …0101001010110010111110 |
3 | 1100020221121202021101012111 |
4 | 2111000320211022302332 |
5 | 2320233312213120220 |
6 | 33440132140524234 |
7 | 2104553331621640 |
oct | 225007045126276 |
9 | 40227552241174 |
10 | 10240151301310 |
11 | 32989074a4167 |
12 | 1194739b5067a |
13 | 593846993248 |
14 | 2758a9924890 |
15 | 12b5832d915a |
hex | 9503894acbe |
10240151301310 has 32 divisors (see below), whose sum is σ = 21302144614080. Its totient is φ = 3471460599552.
The previous prime is 10240151301299. The next prime is 10240151301313. The reversal of 10240151301310 is 1310315104201.
It is a happy number.
It is a super-2 number, since 2×102401513013102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10240151301313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 821835769 + ... + 821848228.
It is an arithmetic number, because the mean of its divisors is an integer number (665692019190).
Almost surely, 210240151301310 is an apocalyptic number.
10240151301310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10240151301310 is an abundant number, since it is smaller than the sum of its proper divisors (11061993312770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10240151301310 is a wasteful number, since it uses less digits than its factorization.
10240151301310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1643684100.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 10240151301310 its reverse (1310315104201), we get a palindrome (11550466405511).
The spelling of 10240151301310 in words is "ten trillion, two hundred forty billion, one hundred fifty-one million, three hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.624 sec. • engine limits •