Base | Representation |
---|---|
bin | 1001001110001110100110… |
… | …1100110011100000111111 |
3 | 1022220101020002002001021222 |
4 | 2103203221230303200333 |
5 | 2312113302133431411 |
6 | 33322134410343555 |
7 | 2064410506644320 |
oct | 223435154634077 |
9 | 38811202061258 |
10 | 10140043655231 |
11 | 325a406324a66 |
12 | 117926012abbb |
13 | 587281a939c9 |
14 | 270ad0482447 |
15 | 128b748d94db |
hex | 938e9b3383f |
10140043655231 has 16 divisors (see below), whose sum is σ = 11742439746816. Its totient is φ = 8576734304256.
The previous prime is 10140043655219. The next prime is 10140043655257. The reversal of 10140043655231 is 13255634004101.
It is a cyclic number.
It is not a de Polignac number, because 10140043655231 - 214 = 10140043638847 is a prime.
It is a super-2 number, since 2×101400436552312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10140043655191 and 10140043655200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140043652231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26146241 + ... + 26531226.
It is an arithmetic number, because the mean of its divisors is an integer number (733902484176).
Almost surely, 210140043655231 is an apocalyptic number.
10140043655231 is a deficient number, since it is larger than the sum of its proper divisors (1602396091585).
10140043655231 is a wasteful number, since it uses less digits than its factorization.
10140043655231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52677838.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 10140043655231 its reverse (13255634004101), we get a palindrome (23395677659332).
The spelling of 10140043655231 in words is "ten trillion, one hundred forty billion, forty-three million, six hundred fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •