Base | Representation |
---|---|
bin | 1001001110010000000011… |
… | …1100000010001110111110 |
3 | 1022220102020020200102012220 |
4 | 2103210000330002032332 |
5 | 2312120101440224041 |
6 | 33322241214510210 |
7 | 2064423252531036 |
oct | 223440074021676 |
9 | 38812206612186 |
10 | 10140433523646 |
11 | 325a5963aa968 |
12 | 117934a805366 |
13 | 58731479888a |
14 | 270b2a16a8c6 |
15 | 128b98c4ad66 |
hex | 93900f023be |
10140433523646 has 16 divisors (see below), whose sum is σ = 20280910896000. Its totient is φ = 3380137199768.
The previous prime is 10140433523609. The next prime is 10140433523687. The reversal of 10140433523646 is 64632533404101.
It is a super-2 number, since 2×101404335236462 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10140433523598 and 10140433523607.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1704415 + ... + 4815173.
It is an arithmetic number, because the mean of its divisors is an integer number (1267556931000).
Almost surely, 210140433523646 is an apocalyptic number.
10140433523646 is an abundant number, since it is smaller than the sum of its proper divisors (10140477372354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10140433523646 is a wasteful number, since it uses less digits than its factorization.
10140433523646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3654063.
The product of its (nonzero) digits is 622080, while the sum is 42.
Adding to 10140433523646 its reverse (64632533404101), we get a palindrome (74772966927747).
The spelling of 10140433523646 in words is "ten trillion, one hundred forty billion, four hundred thirty-three million, five hundred twenty-three thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •