Base | Representation |
---|---|
bin | 10110110101011100110111… |
… | …100111010111110110001110 |
3 | 111011121000210001201211001100 |
4 | 112311130313213113312032 |
5 | 101130421423224204132 |
6 | 553332550413523530 |
7 | 30103560552245241 |
oct | 2665346747276616 |
9 | 434530701654040 |
10 | 100430153350542 |
11 | 2a0002093a3094 |
12 | b3200531a35a6 |
13 | 44066a484c332 |
14 | 1ab2bb993b258 |
15 | b926434d437c |
hex | 5b57379d7d8e |
100430153350542 has 12 divisors (see below), whose sum is σ = 217598665592880. Its totient is φ = 33476717783508.
The previous prime is 100430153350523. The next prime is 100430153350547. The reversal of 100430153350542 is 245053351034001.
100430153350542 is a `hidden beast` number, since 1 + 0 + 0 + 4 + 30 + 1 + 5 + 33 + 50 + 542 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 100430153350497 and 100430153350506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100430153350547) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2789726481942 + ... + 2789726481977.
It is an arithmetic number, because the mean of its divisors is an integer number (18133222132740).
Almost surely, 2100430153350542 is an apocalyptic number.
100430153350542 is an abundant number, since it is smaller than the sum of its proper divisors (117168512242338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100430153350542 is a wasteful number, since it uses less digits than its factorization.
100430153350542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5579452963927 (or 5579452963924 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 100430153350542 in words is "one hundred trillion, four hundred thirty billion, one hundred fifty-three million, three hundred fifty thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •