Base | Representation |
---|---|
bin | 10111000101110001000111… |
… | …101111000010100111010000 |
3 | 111022120012221101102111020222 |
4 | 113011301013233002213100 |
5 | 101302304242011313212 |
6 | 555552023540452212 |
7 | 30250563420602066 |
oct | 2705610757024720 |
9 | 438505841374228 |
10 | 101551410260432 |
11 | 2a3a279071a100 |
12 | b4814159aa068 |
13 | 4488345530ca2 |
14 | 1b111861d2036 |
15 | bb18ba22dc72 |
hex | 5c5c47bc29d0 |
101551410260432 has 30 divisors (see below), whose sum is σ = 216268834975074. Its totient is φ = 46159731935680.
The previous prime is 101551410260413. The next prime is 101551410260477. The reversal of 101551410260432 is 234062014155101.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 91394670723136 + 10156739537296 = 9560056^2 + 3186964^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101551410260392 and 101551410260401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 26227118483 + ... + 26227122354.
Almost surely, 2101551410260432 is an apocalyptic number.
It is an amenable number.
101551410260432 is an abundant number, since it is smaller than the sum of its proper divisors (114717424714642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101551410260432 is a wasteful number, since it uses less digits than its factorization.
101551410260432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52454240867 (or 52454240850 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 35.
The spelling of 101551410260432 in words is "one hundred one trillion, five hundred fifty-one billion, four hundred ten million, two hundred sixty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •