Base | Representation |
---|---|
bin | 10011000100101101… |
… | …00011001110110110 |
3 | 222102122101120101120 |
4 | 21202112203032312 |
5 | 131432420410423 |
6 | 4412035004410 |
7 | 511520451000 |
oct | 114226431666 |
9 | 28378346346 |
10 | 10240013238 |
11 | 4385247564 |
12 | 1b99439706 |
13 | c72644340 |
14 | 6d1d9d370 |
15 | 3edebcee3 |
hex | 2625a33b6 |
10240013238 has 64 divisors (see below), whose sum is σ = 25720665600. Its totient is φ = 2700655776.
The previous prime is 10240013237. The next prime is 10240013243. The reversal of 10240013238 is 83231004201.
10240013238 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102400132382 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10240013233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 164620 + ... + 218127.
It is an arithmetic number, because the mean of its divisors is an integer number (401885400).
Almost surely, 210240013238 is an apocalyptic number.
10240013238 is an abundant number, since it is smaller than the sum of its proper divisors (15480652362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10240013238 is a wasteful number, since it uses less digits than its factorization.
10240013238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382786 (or 382772 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 10240013238 its reverse (83231004201), we get a palindrome (93471017439).
The spelling of 10240013238 in words is "ten billion, two hundred forty million, thirteen thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •