Base | Representation |
---|---|
bin | 1100001011000… |
… | …10000111001100 |
3 | 21010010220201101 |
4 | 12011202013030 |
5 | 202120114430 |
6 | 14044352444 |
7 | 2346644461 |
oct | 605420714 |
9 | 233126641 |
10 | 102113740 |
11 | 52705623 |
12 | 2a245724 |
13 | 18203941 |
14 | d7c1668 |
15 | 8e70dca |
hex | 61621cc |
102113740 has 24 divisors (see below), whose sum is σ = 215141472. Its totient is φ = 40711680.
The previous prime is 102113731. The next prime is 102113749. The reversal of 102113740 is 47311201.
It is an interprime number because it is at equal distance from previous prime (102113731) and next prime (102113749).
It is not an unprimeable number, because it can be changed into a prime (102113749) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1989 + ... + 14428.
It is an arithmetic number, because the mean of its divisors is an integer number (8964228).
Almost surely, 2102113740 is an apocalyptic number.
102113740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102113740 is an abundant number, since it is smaller than the sum of its proper divisors (113027732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102113740 is a wasteful number, since it uses less digits than its factorization.
102113740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16737 (or 16735 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 19.
The square root of 102113740 is about 10105.1343385430. The cubic root of 102113740 is about 467.4064784759.
Adding to 102113740 its reverse (47311201), we get a palindrome (149424941).
The spelling of 102113740 in words is "one hundred two million, one hundred thirteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •