Base | Representation |
---|---|
bin | 1001001110001111111111… |
… | …0011001101000000000111 |
3 | 1022220102011220202102100201 |
4 | 2103203333303031000013 |
5 | 2312120032043244424 |
6 | 33322235253351331 |
7 | 2064422631332041 |
oct | 223437763150007 |
9 | 38812156672321 |
10 | 10140414431239 |
11 | 325a58664a514 |
12 | 1179344338547 |
13 | 5873108425b1 |
14 | 270b277daa91 |
15 | 128b97228d44 |
hex | 938ffccd007 |
10140414431239 has 8 divisors (see below), whose sum is σ = 10356324330240. Its totient is φ = 9924511049016.
The previous prime is 10140414431227. The next prime is 10140414431249. The reversal of 10140414431239 is 93213441404101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10140414431239 - 237 = 10002975477767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10140414431198 and 10140414431207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140414431249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1582732 + ... + 4773454.
It is an arithmetic number, because the mean of its divisors is an integer number (1294540541280).
Almost surely, 210140414431239 is an apocalyptic number.
10140414431239 is a deficient number, since it is larger than the sum of its proper divisors (215909899001).
10140414431239 is an equidigital number, since it uses as much as digits as its factorization.
10140414431239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3258389.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 10140414431239 in words is "ten trillion, one hundred forty billion, four hundred fourteen million, four hundred thirty-one thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •