Base | Representation |
---|---|
bin | 101111000100101100… |
… | …0101110101010110100 |
3 | 100122221002011220010020 |
4 | 1132021120232222310 |
5 | 3124012314142022 |
6 | 114234552325140 |
7 | 10206041045661 |
oct | 1361130565264 |
9 | 318832156106 |
10 | 101089209012 |
11 | 3996524aa40 |
12 | 177126a37b0 |
13 | 96c038280c |
14 | 4c6d990a68 |
15 | 2969b8d35c |
hex | 178962eab4 |
101089209012 has 48 divisors (see below), whose sum is σ = 258019249152. Its totient is φ = 30549610080.
The previous prime is 101089208963. The next prime is 101089209019. The reversal of 101089209012 is 210902980101.
It is a super-2 number, since 2×1010892090122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101089209019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 994918 + ... + 1091805.
It is an arithmetic number, because the mean of its divisors is an integer number (5375401024).
Almost surely, 2101089209012 is an apocalyptic number.
101089209012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101089209012 is an abundant number, since it is smaller than the sum of its proper divisors (156930040140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101089209012 is a wasteful number, since it uses less digits than its factorization.
101089209012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2087108 (or 2087106 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 33.
The spelling of 101089209012 in words is "one hundred one billion, eighty-nine million, two hundred nine thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •