Base | Representation |
---|---|
bin | 110001011110101101… |
… | …0100101010000110100 |
3 | 101011021020102210200102 |
4 | 1202331122211100310 |
5 | 3220103302433200 |
6 | 120451441533232 |
7 | 10451102153243 |
oct | 1427532452064 |
9 | 334236383612 |
10 | 106257077300 |
11 | 41077393970 |
12 | 18715344218 |
13 | a034c2834a |
14 | 520006c95a |
15 | 2b6d7036d5 |
hex | 18bd6a5434 |
106257077300 has 288 divisors, whose sum is σ = 265425678336. Its totient is φ = 36578304000.
The previous prime is 106257077299. The next prime is 106257077323. The reversal of 106257077300 is 3770752601.
It is a super-2 number, since 2×1062570773002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 315302732 + ... + 315303068.
Almost surely, 2106257077300 is an apocalyptic number.
106257077300 is a gapful number since it is divisible by the number (10) 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 106257077300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132712839168).
106257077300 is an abundant number, since it is smaller than the sum of its proper divisors (159168601036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106257077300 is a wasteful number, since it uses less digits than its factorization.
106257077300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 587 (or 580 counting only the distinct ones).
The product of its (nonzero) digits is 61740, while the sum is 38.
It can be divided in two parts, 10 and 6257077300, that multiplied together give a cube (62570773000 = 39703).
The spelling of 106257077300 in words is "one hundred six billion, two hundred fifty-seven million, seventy-seven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •