Base | Representation |
---|---|
bin | 1001001110001111010011… |
… | …0101011011101011001101 |
3 | 1022220101201002121000211201 |
4 | 2103203310311123223031 |
5 | 2312114142444410003 |
6 | 33322205122345501 |
7 | 2064415235551006 |
oct | 223436465335315 |
9 | 38811632530751 |
10 | 10140230466253 |
11 | 325a4a1819938 |
12 | 11792b27bb291 |
13 | 5872b16b0a84 |
14 | 270b0b1d01ad |
15 | 128b85edab1d |
hex | 938f4d5bacd |
10140230466253 has 8 divisors (see below), whose sum is σ = 10279270360376. Its totient is φ = 10001194156800.
The previous prime is 10140230466199. The next prime is 10140230466257. The reversal of 10140230466253 is 35266403204101.
It can be written as a sum of positive squares in 4 ways, for example, as 1106731352169 + 9033499114084 = 1052013^2 + 3005578^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10140230466253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140230466257) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5070673 + ... + 6781753.
It is an arithmetic number, because the mean of its divisors is an integer number (1284908795047).
Almost surely, 210140230466253 is an apocalyptic number.
It is an amenable number.
10140230466253 is a deficient number, since it is larger than the sum of its proper divisors (139039894123).
10140230466253 is an equidigital number, since it uses as much as digits as its factorization.
10140230466253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1792335.
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 10140230466253 in words is "ten trillion, one hundred forty billion, two hundred thirty million, four hundred sixty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •