Base | Representation |
---|---|
bin | 110000111010111001… |
… | …0000001011000011000 |
3 | 101001011111000021100020 |
4 | 1201311302001120120 |
5 | 3210123121342412 |
6 | 120132310510440 |
7 | 10406236665234 |
oct | 1416562013030 |
9 | 331144007306 |
10 | 105055262232 |
11 | 4060aa58478 |
12 | 1843a965420 |
13 | 9ba2c4997b |
14 | 51285c95c4 |
15 | 2aece5a18c |
hex | 1875c81618 |
105055262232 has 64 divisors (see below), whose sum is σ = 276523632000. Its totient is φ = 33167856384.
The previous prime is 105055262177. The next prime is 105055262261. The reversal of 105055262232 is 232262550501.
It is a super-2 number, since 2×1050552622322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105055262193 and 105055262202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2205823 + ... + 2252945.
It is an arithmetic number, because the mean of its divisors is an integer number (4320681750).
Almost surely, 2105055262232 is an apocalyptic number.
105055262232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105055262232 is an abundant number, since it is smaller than the sum of its proper divisors (171468369768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105055262232 is a wasteful number, since it uses less digits than its factorization.
105055262232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52040 (or 52036 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 33.
The spelling of 105055262232 in words is "one hundred five billion, fifty-five million, two hundred sixty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •