Base | Representation |
---|---|
bin | 101110100101001000… |
… | …0101010111100100000 |
3 | 100120012021100012120201 |
4 | 1131022100222330200 |
5 | 3114330203211000 |
6 | 113541520514544 |
7 | 10140561043621 |
oct | 1351220527440 |
9 | 316167305521 |
10 | 100030132000 |
11 | 39471446787 |
12 | 17477a7ba54 |
13 | 9581b2c826 |
14 | 4bad065a48 |
15 | 2906bdc96a |
hex | 174a42af20 |
100030132000 has 48 divisors (see below), whose sum is σ = 245774044152. Its totient is φ = 40012051200.
The previous prime is 100030131931. The next prime is 100030132009. The reversal of 100030132000 is 231030001.
It can be written as a sum of positive squares in 4 ways, for example, as 20418123664 + 79612008336 = 142892^2 + 282156^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (100030132009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12499767 + ... + 12507766.
Almost surely, 2100030132000 is an apocalyptic number.
100030132000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100030132000 is an abundant number, since it is smaller than the sum of its proper divisors (145743912152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100030132000 is an equidigital number, since it uses as much as digits as its factorization.
100030132000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25007558 (or 25007540 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 100030132000 its reverse (231030001), we get a palindrome (100261162001).
It can be divided in two parts, 1000301 and 32000, that added together give a palindrome (1032301).
The spelling of 100030132000 in words is "one hundred billion, thirty million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •