Base | Representation |
---|---|
bin | 1100001111101… |
… | …11101010101000 |
3 | 21011022001000020 |
4 | 12013313222220 |
5 | 202244220222 |
6 | 14105440440 |
7 | 2355105423 |
oct | 607675250 |
9 | 234261006 |
10 | 102726312 |
11 | 52a93887 |
12 | 2a4a0120 |
13 | 18389700 |
14 | d9009ba |
15 | 904265c |
hex | 61f7aa8 |
102726312 has 192 divisors, whose sum is σ = 309196800. Its totient is φ = 28304640.
The previous prime is 102726311. The next prime is 102726317. The reversal of 102726312 is 213627201.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (102726311) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2388963 + ... + 2389005.
It is an arithmetic number, because the mean of its divisors is an integer number (1610400).
Almost surely, 2102726312 is an apocalyptic number.
102726312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102726312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154598400).
102726312 is an abundant number, since it is smaller than the sum of its proper divisors (206470488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102726312 is a wasteful number, since it uses less digits than its factorization.
102726312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 111 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 24.
The square root of 102726312 is about 10135.3989561339. The cubic root of 102726312 is about 468.3392601786.
The spelling of 102726312 in words is "one hundred two million, seven hundred twenty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •