Base | Representation |
---|---|
bin | 1100001100000… |
… | …10100000011111 |
3 | 21010101122201212 |
4 | 12012002200133 |
5 | 202133341211 |
6 | 14051255035 |
7 | 2351036360 |
oct | 606024037 |
9 | 233348655 |
10 | 102246431 |
11 | 52796291 |
12 | 2a2aa47b |
13 | 1824c161 |
14 | d817b67 |
15 | 8e9a38b |
hex | 618281f |
102246431 has 32 divisors (see below), whose sum is σ = 128563200. Its totient is φ = 79390080.
The previous prime is 102246421. The next prime is 102246433. The reversal of 102246431 is 134642201.
It is not a de Polignac number, because 102246431 - 26 = 102246367 is a prime.
It is a super-2 number, since 2×1022464312 = 20908665304475522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102246397 and 102246406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102246433) 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 31 ways as a sum of consecutive naturals, for example, 284630 + ... + 284988.
It is an arithmetic number, because the mean of its divisors is an integer number (4017600).
Almost surely, 2102246431 is an apocalyptic number.
102246431 is a deficient number, since it is larger than the sum of its proper divisors (26316769).
102246431 is a wasteful number, since it uses less digits than its factorization.
102246431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 102246431 is about 10111.6977308462. The cubic root of 102246431 is about 467.6088468947.
Adding to 102246431 its reverse (134642201), we get a palindrome (236888632).
The spelling of 102246431 in words is "one hundred two million, two hundred forty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •