Base | Representation |
---|---|
bin | 1001001110001111010010… |
… | …0011000111011001110000 |
3 | 1022220101200202120002020121 |
4 | 2103203310203013121300 |
5 | 2312114140232231444 |
6 | 33322204431420024 |
7 | 2064415150002046 |
oct | 223436443073160 |
9 | 38811622502217 |
10 | 10140225664624 |
11 | 325a49a03a350 |
12 | 11792b1084614 |
13 | 5872b06bc383 |
14 | 270b0a700396 |
15 | 128b8588d084 |
hex | 938f48c7670 |
10140225664624 has 20 divisors (see below), whose sum is σ = 21432749700600. Its totient is φ = 4609193483840.
The previous prime is 10140225664559. The next prime is 10140225664627. The reversal of 10140225664624 is 42646652204101.
It is a super-2 number, since 2×101402256646242 (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 (10140225664627) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28807459099 + ... + 28807459450.
It is an arithmetic number, because the mean of its divisors is an integer number (1071637485030).
Almost surely, 210140225664624 is an apocalyptic number.
It is an amenable number.
10140225664624 is an abundant number, since it is smaller than the sum of its proper divisors (11292524035976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10140225664624 is a wasteful number, since it uses less digits than its factorization.
10140225664624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57614918568 (or 57614918562 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 43.
Adding to 10140225664624 its reverse (42646652204101), we get a palindrome (52786877868725).
The spelling of 10140225664624 in words is "ten trillion, one hundred forty billion, two hundred twenty-five million, six hundred sixty-four thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •