Base | Representation |
---|---|
bin | 10110111111001001011010… |
… | …000111110110001000111100 |
3 | 111020221201121120121101000220 |
4 | 112333021122013312020330 |
5 | 101222331013232010302 |
6 | 555003022523021340 |
7 | 30202656221215254 |
oct | 2677113207661074 |
9 | 436851546541026 |
10 | 101096452219452 |
11 | 2a237845776128 |
12 | b40920536a850 |
13 | 445447bbc5791 |
14 | 1ad7147040964 |
15 | ba4b3da764bc |
hex | 5bf25a1f623c |
101096452219452 has 48 divisors (see below), whose sum is σ = 249791147817120. Its totient is φ = 31713557225472.
The previous prime is 101096452219447. The next prime is 101096452219463. The reversal of 101096452219452 is 254912254690101.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 101096452219395 and 101096452219404.
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, 21076927 + ... + 25424982.
It is an arithmetic number, because the mean of its divisors is an integer number (5203982246190).
Almost surely, 2101096452219452 is an apocalyptic number.
101096452219452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101096452219452 is an abundant number, since it is smaller than the sum of its proper divisors (148694695597668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101096452219452 is a wasteful number, since it uses less digits than its factorization.
101096452219452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46512590 (or 46512588 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 51.
The spelling of 101096452219452 in words is "one hundred one trillion, ninety-six billion, four hundred fifty-two million, two hundred nineteen thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •