Base | Representation |
---|---|
bin | 10110110101011101000110… |
… | …011001010011100010101100 |
3 | 111011121001102100100000202021 |
4 | 112311131012121103202230 |
5 | 101130422430214234012 |
6 | 553333031152435524 |
7 | 30103566653045461 |
oct | 2665350631234254 |
9 | 434531370300667 |
10 | 100430401321132 |
11 | 2a000326370063 |
12 | b320102248ba4 |
13 | 44067140310ac |
14 | 1ab2c00849668 |
15 | b9265a167007 |
hex | 5b57466538ac |
100430401321132 has 12 divisors (see below), whose sum is σ = 176932754006400. Its totient is φ = 49878185890736.
The previous prime is 100430401321123. The next prime is 100430401321139. The reversal of 100430401321132 is 231123104034001.
It is a super-2 number, since 2×1004304013211322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100430401321097 and 100430401321106.
It is not an unprimeable number, because it can be changed into a prime (100430401321139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84253691788 + ... + 84253692979.
It is an arithmetic number, because the mean of its divisors is an integer number (14744396167200).
Almost surely, 2100430401321132 is an apocalyptic number.
It is an amenable number.
100430401321132 is a deficient number, since it is larger than the sum of its proper divisors (76502352685268).
100430401321132 is a wasteful number, since it uses less digits than its factorization.
100430401321132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168507384920 (or 168507384918 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 100430401321132 its reverse (231123104034001), we get a palindrome (331553505355133).
The spelling of 100430401321132 in words is "one hundred trillion, four hundred thirty billion, four hundred one million, three hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •