Base | Representation |
---|---|
bin | 1100010001110… |
… | …01101000110011 |
3 | 21011210202200100 |
4 | 12020321220303 |
5 | 202331342111 |
6 | 14115323443 |
7 | 2360312301 |
oct | 610715063 |
9 | 234722610 |
10 | 102996531 |
11 | 53158900 |
12 | 2a5b0583 |
13 | 184526c1 |
14 | d971271 |
15 | 9097756 |
hex | 6239a33 |
102996531 has 36 divisors (see below), whose sum is σ = 164600800. Its totient is φ = 62013600.
The previous prime is 102996529. The next prime is 102996547. The reversal of 102996531 is 135699201.
102996531 is a `hidden beast` number, since 10 + 29 + 96 + 531 = 666.
It is not a de Polignac number, because 102996531 - 21 = 102996529 is a prime.
It is a super-2 number, since 2×1029965312 = 21216570796067922, which contains 22 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 Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102996571) 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 35 ways as a sum of consecutive naturals, for example, 294945 + ... + 295293.
Almost surely, 2102996531 is an apocalyptic number.
102996531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102996531 is a deficient number, since it is larger than the sum of its proper divisors (61604269).
102996531 is a wasteful number, since it uses less digits than its factorization.
102996531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648 (or 634 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 36.
The square root of 102996531 is about 10148.7206582899. The cubic root of 102996531 is about 468.7495522129.
The spelling of 102996531 in words is "one hundred two million, nine hundred ninety-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •