Base | Representation |
---|---|
bin | 10111111001010101011110… |
… | …000110010001101101110000 |
3 | 111210002222220112211122012011 |
4 | 113321111132012101231300 |
5 | 102233334313132011202 |
6 | 1011304012055412304 |
7 | 31064605244066452 |
oct | 2771253606215560 |
9 | 453088815748164 |
10 | 105095133469552 |
11 | 30539661023446 |
12 | b954183684094 |
13 | 468457571cb15 |
14 | 1bd48bb17c2d2 |
15 | c23b73d8abd7 |
hex | 5f955e191b70 |
105095133469552 has 80 divisors (see below), whose sum is σ = 213676611821568. Its totient is φ = 50014508440320.
The previous prime is 105095133469537. The next prime is 105095133469561. The reversal of 105095133469552 is 255964331590501.
It is a happy number.
It is a super-2 number, since 2×1050951334695522 (a number of 29 digits) contains 22 as substring.
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, 3456618 + ... + 14904310.
Almost surely, 2105095133469552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105095133469552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106838305910784).
105095133469552 is an abundant number, since it is smaller than the sum of its proper divisors (108581478352016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105095133469552 is a wasteful number, since it uses less digits than its factorization.
105095133469552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11448038 (or 11448032 counting only the distinct ones).
The product of its (nonzero) digits is 21870000, while the sum is 58.
The spelling of 105095133469552 in words is "one hundred five trillion, ninety-five billion, one hundred thirty-three million, four hundred sixty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •