Base | Representation |
---|---|
bin | 1100001010011… |
… | …01111100110000 |
3 | 21002222201102120 |
4 | 12011031330300 |
5 | 202104444102 |
6 | 14042514240 |
7 | 2346151626 |
oct | 605157460 |
9 | 232881376 |
10 | 102031152 |
11 | 52659573 |
12 | 2a205980 |
13 | 181a5182 |
14 | d79d516 |
15 | 8e566bc |
hex | 614df30 |
102031152 has 20 divisors (see below), whose sum is σ = 263580600. Its totient is φ = 34010368.
The previous prime is 102031147. The next prime is 102031157. The reversal of 102031152 is 251130201.
It is an interprime number because it is at equal distance from previous prime (102031147) and next prime (102031157).
It is not an unprimeable number, because it can be changed into a prime (102031157) 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 3 ways as a sum of consecutive naturals, for example, 1062777 + ... + 1062872.
It is an arithmetic number, because the mean of its divisors is an integer number (13179030).
Almost surely, 2102031152 is an apocalyptic number.
102031152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102031152 is an abundant number, since it is smaller than the sum of its proper divisors (161549448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102031152 is a wasteful number, since it uses less digits than its factorization.
102031152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2125660 (or 2125654 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 102031152 is about 10101.0470744374. The cubic root of 102031152 is about 467.2804341327.
Adding to 102031152 its reverse (251130201), we get a palindrome (353161353).
The spelling of 102031152 in words is "one hundred two million, thirty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •