Base | Representation |
---|---|
bin | 1100000101011… |
… | …00010011101110 |
3 | 21001202002020000 |
4 | 12002230103232 |
5 | 201422302240 |
6 | 14020405130 |
7 | 2340423435 |
oct | 602542356 |
9 | 231662200 |
10 | 101369070 |
11 | 522470a0 |
12 | 29b467a6 |
13 | 180029ca |
14 | d66a11c |
15 | 8d75430 |
hex | 60ac4ee |
101369070 has 160 divisors (see below), whose sum is σ = 307777536. Its totient is φ = 23716800.
The previous prime is 101369063. The next prime is 101369071. The reversal of 101369070 is 70963101.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101369071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 276027 + ... + 276393.
Almost surely, 2101369070 is an apocalyptic number.
101369070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101369070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153888768).
101369070 is an abundant number, since it is smaller than the sum of its proper divisors (206408466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101369070 is a wasteful number, since it uses less digits than its factorization.
101369070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428 (or 419 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 27.
The square root of 101369070 is about 10068.2207961486. The cubic root of 101369070 is about 466.2675095907.
The spelling of 101369070 in words is "one hundred one million, three hundred sixty-nine thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •