Base | Representation |
---|---|
bin | 10010111000110101… |
… | …11110010101100101 |
3 | 222011201011020222110 |
4 | 21130122332111211 |
5 | 131231432301131 |
6 | 4354122151233 |
7 | 506201623521 |
oct | 113432762545 |
9 | 28151136873 |
10 | 10140509541 |
11 | 43340649a8 |
12 | 1b70052519 |
13 | c57b45706 |
14 | 6c2a9ad81 |
15 | 3e53b5646 |
hex | 25c6be565 |
10140509541 has 32 divisors (see below), whose sum is σ = 14333469696. Its totient is φ = 6366528000.
The previous prime is 10140509527. The next prime is 10140509567. The reversal of 10140509541 is 14590504101.
It is not a de Polignac number, because 10140509541 - 222 = 10136315237 is a prime.
It is a super-2 number, since 2×101405095412 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10140509499 and 10140509508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140509941) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1602115 + ... + 1608431.
It is an arithmetic number, because the mean of its divisors is an integer number (447920928).
Almost surely, 210140509541 is an apocalyptic number.
It is an amenable number.
10140509541 is a deficient number, since it is larger than the sum of its proper divisors (4192960155).
10140509541 is a wasteful number, since it uses less digits than its factorization.
10140509541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6813.
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 10140509541 in words is "ten billion, one hundred forty million, five hundred nine thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •