Base | Representation |
---|---|
bin | 110001000100001110… |
… | …0110000001011001000 |
3 | 101001222022100001110010 |
4 | 1202020130300023020 |
5 | 3211243311010312 |
6 | 120223335351520 |
7 | 10420062036255 |
oct | 1421034601310 |
9 | 331868301403 |
10 | 105368453832 |
11 | 40760821a04 |
12 | 185078225a0 |
13 | 9c22ab5c45 |
14 | 515803442c |
15 | 2b1a6c293c |
hex | 18887302c8 |
105368453832 has 16 divisors (see below), whose sum is σ = 263421134640. Its totient is φ = 35122817936.
The previous prime is 105368453807. The next prime is 105368453833. The reversal of 105368453832 is 238354863501.
It is a happy number.
It is a super-2 number, since 2×1053684538322 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105368453833) 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 3 ways as a sum of consecutive naturals, for example, 2195176098 + ... + 2195176145.
It is an arithmetic number, because the mean of its divisors is an integer number (16463820915).
Almost surely, 2105368453832 is an apocalyptic number.
105368453832 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105368453832 is an abundant number, since it is smaller than the sum of its proper divisors (158052680808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105368453832 is a wasteful number, since it uses less digits than its factorization.
105368453832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4390352252 (or 4390352248 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 105368453832 in words is "one hundred five billion, three hundred sixty-eight million, four hundred fifty-three thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •