Base | Representation |
---|---|
bin | 10000101110000… |
… | …11011101111111 |
3 | 100202221000021000 |
4 | 20113003131333 |
5 | 241401324442 |
6 | 21530141343 |
7 | 3322125630 |
oct | 1027033577 |
9 | 322830230 |
10 | 140261247 |
11 | 721a0395 |
12 | 3ab81853 |
13 | 2309c229 |
14 | 148b1887 |
15 | c4a8d4c |
hex | 85c377f |
140261247 has 32 divisors (see below), whose sum is σ = 238338560. Its totient is φ = 79859520.
The previous prime is 140261243. The next prime is 140261263. The reversal of 140261247 is 742162041.
140261247 is a `hidden beast` number, since 1 + 4 + 0 + 2 + 612 + 47 = 666.
It is not a de Polignac number, because 140261247 - 22 = 140261243 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 140261247.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140261243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57972 + ... + 60342.
It is an arithmetic number, because the mean of its divisors is an integer number (7448080).
Almost surely, 2140261247 is an apocalyptic number.
140261247 is a deficient number, since it is larger than the sum of its proper divisors (98077313).
140261247 is a wasteful number, since it uses less digits than its factorization.
140261247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2700 (or 2694 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 140261247 is about 11843.1941215198. The cubic root of 140261247 is about 519.5721912804.
The spelling of 140261247 in words is "one hundred forty million, two hundred sixty-one thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •