Base | Representation |
---|---|
bin | 10110110001010110010111… |
… | …100101110000000000110000 |
3 | 111010121002020220211110011220 |
4 | 112301112113211300000300 |
5 | 101111312202144241212 |
6 | 552555254130105040 |
7 | 30044322061565364 |
oct | 2661262745600060 |
9 | 433532226743156 |
10 | 100148295696432 |
11 | 29a01721072885 |
12 | b2954b171b180 |
13 | 43b5c365a0049 |
14 | 1aa32bc0bb2a4 |
15 | b8a14894a38c |
hex | 5b1597970030 |
100148295696432 has 80 divisors (see below), whose sum is σ = 260883397929600. Its totient is φ = 33104068816896.
The previous prime is 100148295696431. The next prime is 100148295696451. The reversal of 100148295696432 is 234696592841001.
It is a super-2 number, since 2×1001482956964322 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100148295696431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10741078 + ... + 17767029.
It is an arithmetic number, because the mean of its divisors is an integer number (3261042474120).
Almost surely, 2100148295696432 is an apocalyptic number.
100148295696432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100148295696432 is an abundant number, since it is smaller than the sum of its proper divisors (160735102233168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100148295696432 is a wasteful number, since it uses less digits than its factorization.
100148295696432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28508730 (or 28508724 counting only the distinct ones).
The product of its (nonzero) digits is 22394880, while the sum is 60.
The spelling of 100148295696432 in words is "one hundred trillion, one hundred forty-eight billion, two hundred ninety-five million, six hundred ninety-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •