Base | Representation |
---|---|
bin | 110001001000100110… |
… | …0110000010101011100 |
3 | 101002100112120022222022 |
4 | 1202101030300111130 |
5 | 3212043401131012 |
6 | 120250102035312 |
7 | 10423523604350 |
oct | 1422114602534 |
9 | 332315508868 |
10 | 105515255132 |
11 | 408266799a1 |
12 | 18548a18b38 |
13 | 9c47334c11 |
14 | 516d729460 |
15 | 2b2851e472 |
hex | 189133055c |
105515255132 has 24 divisors (see below), whose sum is σ = 211229093376. Its totient is φ = 45178270128.
The previous prime is 105515255123. The next prime is 105515255143. The reversal of 105515255132 is 231552515501.
It is a super-2 number, since 2×1055152551322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105515255092 and 105515255101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1742768 + ... + 1802295.
It is an arithmetic number, because the mean of its divisors is an integer number (8801212224).
Almost surely, 2105515255132 is an apocalyptic number.
It is an amenable number.
105515255132 is an abundant number, since it is smaller than the sum of its proper divisors (105713838244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105515255132 is a wasteful number, since it uses less digits than its factorization.
105515255132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3546137 (or 3546135 counting only the distinct ones).
The product of its (nonzero) digits is 37500, while the sum is 35.
The spelling of 105515255132 in words is "one hundred five billion, five hundred fifteen million, two hundred fifty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •