Base | Representation |
---|---|
bin | 101110100100010000… |
… | …0000001001111011010 |
3 | 100120010012202212201211 |
4 | 1131020200001033122 |
5 | 3114300123213200 |
6 | 113534543533334 |
7 | 10140052040560 |
oct | 1351040011732 |
9 | 316105685654 |
10 | 100000601050 |
11 | 39456806739 |
12 | 17469bba24a |
13 | 95789901ac |
14 | 4ba9179a30 |
15 | 2904307aba |
hex | 17488013da |
100000601050 has 48 divisors (see below), whose sum is σ = 217757437632. Its totient is φ = 33449673600.
The previous prime is 100000601021. The next prime is 100000601069. The reversal of 100000601050 is 50106000001.
100000601050 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1000006010502 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100000601050.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3469992 + ... + 3498691.
It is an arithmetic number, because the mean of its divisors is an integer number (4536613284).
Almost surely, 2100000601050 is an apocalyptic number.
100000601050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000601050 is an abundant number, since it is smaller than the sum of its proper divisors (117756836582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000601050 is a wasteful number, since it uses less digits than its factorization.
100000601050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6968743 (or 6968738 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 13.
Adding to 100000601050 its reverse (50106000001), we get a palindrome (150106601051).
The spelling of 100000601050 in words is "one hundred billion, six hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •