Base | Representation |
---|---|
bin | 101110110000001100… |
… | …0101100100100000101 |
3 | 100121011010211020201200 |
4 | 1131200120230210011 |
5 | 3121110220201113 |
6 | 114042421013113 |
7 | 10153016156013 |
oct | 1354030544405 |
9 | 317133736650 |
10 | 100401334533 |
11 | 39641a32735 |
12 | 17560254199 |
13 | 96109ca5b6 |
14 | 4c064918b3 |
15 | 29295b3873 |
hex | 176062c905 |
100401334533 has 12 divisors (see below), whose sum is σ = 145032721548. Its totient is φ = 66930266880.
The previous prime is 100401334511. The next prime is 100401334639. The reversal of 100401334533 is 335433104001.
It can be written as a sum of positive squares in 2 ways, for example, as 33082880769 + 67318453764 = 181887^2 + 259458^2 .
It is not a de Polignac number, because 100401334533 - 29 = 100401334021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100401334497 and 100401334506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100401334133) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 164598 + ... + 477383.
It is an arithmetic number, because the mean of its divisors is an integer number (12086060129).
Almost surely, 2100401334533 is an apocalyptic number.
It is an amenable number.
100401334533 is a deficient number, since it is larger than the sum of its proper divisors (44631387015).
100401334533 is a wasteful number, since it uses less digits than its factorization.
100401334533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659364 (or 659361 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 100401334533 its reverse (335433104001), we get a palindrome (435834438534).
The spelling of 100401334533 in words is "one hundred billion, four hundred one million, three hundred thirty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •