Base | Representation |
---|---|
bin | 1001001110001110100100… |
… | …1110001011000100011011 |
3 | 1022220101012111222002020000 |
4 | 2103203221032023010123 |
5 | 2312113243110001433 |
6 | 33322133522304043 |
7 | 2064410351461266 |
oct | 223435116130433 |
9 | 38811174862200 |
10 | 10140035625243 |
11 | 325a40183aa07 |
12 | 11792594b8023 |
13 | 587280211a34 |
14 | 270acd391cdd |
15 | 128b73d50113 |
hex | 938e938b11b |
10140035625243 has 40 divisors (see below), whose sum is σ = 15842051808000. Its totient is φ = 6451379974512.
The previous prime is 10140035625211. The next prime is 10140035625347. The reversal of 10140035625243 is 34252653004101.
10140035625243 is a `hidden beast` number, since 1 + 0 + 1 + 4 + 0 + 0 + 3 + 5 + 625 + 24 + 3 = 666.
It is not a de Polignac number, because 10140035625243 - 25 = 10140035625211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10140035625198 and 10140035625207.
It is not an unprimeable number, because it can be changed into a prime (10140035626243) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5381293 + ... + 7017006.
It is an arithmetic number, because the mean of its divisors is an integer number (396051295200).
Almost surely, 210140035625243 is an apocalyptic number.
10140035625243 is a deficient number, since it is larger than the sum of its proper divisors (5702016182757).
10140035625243 is a wasteful number, since it uses less digits than its factorization.
10140035625243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12398773 (or 12398764 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 10140035625243 its reverse (34252653004101), we get a palindrome (44392688629344).
The spelling of 10140035625243 in words is "ten trillion, one hundred forty billion, thirty-five million, six hundred twenty-five thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •