Base | Representation |
---|---|
bin | 110001010011100001… |
… | …0010011010001111000 |
3 | 101010022001221021002020 |
4 | 1202213002103101320 |
5 | 3213321143112212 |
6 | 120350310234440 |
7 | 10435562602350 |
oct | 1424702232170 |
9 | 333261837066 |
10 | 105881613432 |
11 | 409a4457351 |
12 | 1862b655a20 |
13 | 9ca51c7a8a |
14 | 51a6253b60 |
15 | 2b4a789d8c |
hex | 18a7093478 |
105881613432 has 32 divisors (see below), whose sum is σ = 302518896000. Its totient is φ = 30251889504.
The previous prime is 105881613419. The next prime is 105881613433. The reversal of 105881613432 is 234316188501.
It is a happy number.
It is a super-2 number, since 2×1058816134322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105881613433) 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, 315123682 + ... + 315124017.
It is an arithmetic number, because the mean of its divisors is an integer number (9453715500).
Almost surely, 2105881613432 is an apocalyptic number.
105881613432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105881613432 is an abundant number, since it is smaller than the sum of its proper divisors (196637282568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105881613432 is a wasteful number, since it uses less digits than its factorization.
105881613432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 630247715 (or 630247711 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 42.
The spelling of 105881613432 in words is "one hundred five billion, eight hundred eighty-one million, six hundred thirteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •