Base | Representation |
---|---|
bin | 1100001100010… |
… | …01011001001000 |
3 | 21010110002102100 |
4 | 12012021121020 |
5 | 202140242012 |
6 | 14052033400 |
7 | 2351214525 |
oct | 606113110 |
9 | 233402370 |
10 | 102274632 |
11 | 52805499 |
12 | 2a302860 |
13 | 1825bc45 |
14 | d82414c |
15 | 8ea38dc |
hex | 6189648 |
102274632 has 48 divisors (see below), whose sum is σ = 282896640. Its totient is φ = 33365088.
The previous prime is 102274631. The next prime is 102274633. The reversal of 102274632 is 236472201.
102274632 is a `hidden beast` number, since 1 + 0 + 2 + 27 + 4 + 632 = 666.
It is an interprime number because it is at equal distance from previous prime (102274631) and next prime (102274633).
It is a junction number, because it is equal to n+sod(n) for n = 102274596 and 102274605.
It is not an unprimeable number, because it can be changed into a prime (102274631) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11728 + ... + 18495.
It is an arithmetic number, because the mean of its divisors is an integer number (5893680).
Almost surely, 2102274632 is an apocalyptic number.
102274632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102274632 is an abundant number, since it is smaller than the sum of its proper divisors (180622008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102274632 is a wasteful number, since it uses less digits than its factorization.
102274632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30282 (or 30275 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 102274632 is about 10113.0921087470. The cubic root of 102274632 is about 467.6518339693.
The spelling of 102274632 in words is "one hundred two million, two hundred seventy-four thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •