Base | Representation |
---|---|
bin | 110001101011111100… |
… | …1111101100000101100 |
3 | 101012102012201100200201 |
4 | 1203113321331200230 |
5 | 3222011041320300 |
6 | 121003515403244 |
7 | 10465106606401 |
oct | 1432771754054 |
9 | 335365640621 |
10 | 106701510700 |
11 | 412852482a4 |
12 | 1881a153524 |
13 | a0a60263a5 |
14 | 52430bc2a8 |
15 | 2b9774266a |
hex | 18d7e7d82c |
106701510700 has 36 divisors (see below), whose sum is σ = 231556554432. Its totient is φ = 42677972800.
The previous prime is 106701510659. The next prime is 106701510739. The reversal of 106701510700 is 7015107601.
It is a super-2 number, since 2×1067015107002 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2883717 + ... + 2920483.
It is an arithmetic number, because the mean of its divisors is an integer number (6432126512).
Almost surely, 2106701510700 is an apocalyptic number.
106701510700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106701510700 is an abundant number, since it is smaller than the sum of its proper divisors (124855043732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106701510700 is a wasteful number, since it uses less digits than its factorization.
106701510700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65802 (or 65795 counting only the distinct ones).
The product of its (nonzero) digits is 1470, while the sum is 28.
The spelling of 106701510700 in words is "one hundred six billion, seven hundred one million, five hundred ten thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •