Base | Representation |
---|---|
bin | 1001001110001110100110… |
… | …1100110011010111110011 |
3 | 1022220101020002002000111012 |
4 | 2103203221230303113303 |
5 | 2312113302133422033 |
6 | 33322134410341135 |
7 | 2064410506642520 |
oct | 223435154632763 |
9 | 38811202060435 |
10 | 10140043654643 |
11 | 325a406324581 |
12 | 117926012a7ab |
13 | 587281a93666 |
14 | 270ad0482147 |
15 | 128b748d9248 |
hex | 938e9b335f3 |
10140043654643 has 8 divisors (see below), whose sum is σ = 11592336837120. Its totient is φ = 8688679351560.
The previous prime is 10140043654639. The next prime is 10140043654649. The reversal of 10140043654643 is 34645634004101.
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 10140043654643 - 22 = 10140043654639 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10140043654643.
It is not an unprimeable number, because it can be changed into a prime (10140043654649) 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, 232196453 + ... + 232240118.
It is an arithmetic number, because the mean of its divisors is an integer number (1449042104640).
Almost surely, 210140043654643 is an apocalyptic number.
10140043654643 is a deficient number, since it is larger than the sum of its proper divisors (1452293182477).
10140043654643 is an equidigital number, since it uses as much as digits as its factorization.
10140043654643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464439697.
The product of its (nonzero) digits is 414720, while the sum is 41.
Adding to 10140043654643 its reverse (34645634004101), we get a palindrome (44785677658744).
The spelling of 10140043654643 in words is "ten trillion, one hundred forty billion, forty-three million, six hundred fifty-four thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •