Base | Representation |
---|---|
bin | 101111000011110111… |
… | …1100101011011010000 |
3 | 100122212011022112211010 |
4 | 1132013233211123100 |
5 | 3123433240133112 |
6 | 114232125450520 |
7 | 10205254550304 |
oct | 1360757453320 |
9 | 318764275733 |
10 | 101061646032 |
11 | 39950734516 |
12 | 17705410a40 |
13 | 96b7751b69 |
14 | 4c6a057d04 |
15 | 296754663c |
hex | 1787be56d0 |
101061646032 has 20 divisors (see below), whose sum is σ = 261075919040. Its totient is φ = 33687215328.
The previous prime is 101061646031. The next prime is 101061646039. The reversal of 101061646032 is 230646160101.
It is a super-2 number, since 2×1010616460322 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101061646031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1052725432 + ... + 1052725527.
It is an arithmetic number, because the mean of its divisors is an integer number (13053795952).
Almost surely, 2101061646032 is an apocalyptic number.
101061646032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101061646032 is an abundant number, since it is smaller than the sum of its proper divisors (160014273008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101061646032 is a wasteful number, since it uses less digits than its factorization.
101061646032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2105450970 (or 2105450964 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 30.
The spelling of 101061646032 in words is "one hundred one billion, sixty-one million, six hundred forty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •