Base | Representation |
---|---|
bin | 10000110011010… |
… | …10110000100111 |
3 | 100211012211012200 |
4 | 20121222300213 |
5 | 242040241341 |
6 | 21552545543 |
7 | 3331011441 |
oct | 1031526047 |
9 | 324184180 |
10 | 140946471 |
11 | 72619196 |
12 | 3b2522b3 |
13 | 2327c0a3 |
14 | 14a0d491 |
15 | c591db6 |
hex | 866ac27 |
140946471 has 12 divisors (see below), whose sum is σ = 203712600. Its totient is φ = 93907440.
The previous prime is 140946469. The next prime is 140946511. The reversal of 140946471 is 174649041.
140946471 is a `hidden beast` number, since 1 + 4 + 0 + 9 + 4 + 647 + 1 = 666.
It is not a de Polignac number, because 140946471 - 21 = 140946469 is a prime.
It is a super-3 number, since 3×1409464713 (a number of 25 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140946271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15505 + ... + 22853.
It is an arithmetic number, because the mean of its divisors is an integer number (16976050).
Almost surely, 2140946471 is an apocalyptic number.
140946471 is a deficient number, since it is larger than the sum of its proper divisors (62766129).
140946471 is a wasteful number, since it uses less digits than its factorization.
140946471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9486 (or 9483 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 140946471 is about 11872.0878955641. The cubic root of 140946471 is about 520.4169129363.
The spelling of 140946471 in words is "one hundred forty million, nine hundred forty-six thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •