Base | Representation |
---|---|
bin | 101110100111100001… |
… | …0001001101110100000 |
3 | 100120101212000200200122 |
4 | 1131033002021232200 |
5 | 3120011203241000 |
6 | 113553501135412 |
7 | 10142552522201 |
oct | 1351702115640 |
9 | 316355020618 |
10 | 100110212000 |
11 | 39502671aa7 |
12 | 1749a85a568 |
13 | 95955ba446 |
14 | 4bb994d5a8 |
15 | 290dc5a085 |
hex | 174f089ba0 |
100110212000 has 96 divisors (see below), whose sum is σ = 260439837840. Its totient is φ = 37688524800.
The previous prime is 100110211973. The next prime is 100110212009. The reversal of 100110212000 is 212011001.
It can be written as a sum of positive squares in 8 ways, for example, as 5986426384 + 94123785616 = 77372^2 + 306796^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (100110212009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 668105 + ... + 804104.
Almost surely, 2100110212000 is an apocalyptic number.
100110212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100110212000 is an abundant number, since it is smaller than the sum of its proper divisors (160329625840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110212000 is a wasteful number, since it uses less digits than its factorization.
100110212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472251 (or 1472233 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100110212000 its reverse (212011001), we get a palindrome (100322223001).
The spelling of 100110212000 in words is "one hundred billion, one hundred ten million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •