Base | Representation |
---|---|
bin | 10010111000110111… |
… | …01011001100011101 |
3 | 222011201111121000111 |
4 | 21130123223030131 |
5 | 131232004141102 |
6 | 4354130130021 |
7 | 506203320301 |
oct | 113433531435 |
9 | 28151447014 |
10 | 10140693277 |
11 | 433417aa50 |
12 | 1b70120911 |
13 | c57bab230 |
14 | 6c2b07d01 |
15 | 3e53eecd7 |
hex | 25c6eb31d |
10140693277 has 32 divisors (see below), whose sum is σ = 12138182784. Its totient is φ = 8350214400.
The previous prime is 10140693223. The next prime is 10140693289. The reversal of 10140693277 is 77239604101.
It is not a de Polignac number, because 10140693277 - 231 = 7993209629 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140693377) 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, 2652027 + ... + 2655847.
It is an arithmetic number, because the mean of its divisors is an integer number (379318212).
Almost surely, 210140693277 is an apocalyptic number.
It is an amenable number.
10140693277 is a deficient number, since it is larger than the sum of its proper divisors (1997489507).
10140693277 is a wasteful number, since it uses less digits than its factorization.
10140693277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4189.
The product of its (nonzero) digits is 63504, while the sum is 40.
The spelling of 10140693277 in words is "ten billion, one hundred forty million, six hundred ninety-three thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •