Base | Representation |
---|---|
bin | 10110110011100111110111… |
… | …000110110010001101000101 |
3 | 111011011000111020210122211021 |
4 | 112303213313012302031011 |
5 | 101121342122323424331 |
6 | 553155131535111141 |
7 | 30061522303100623 |
oct | 2663476706621505 |
9 | 434130436718737 |
10 | 100304517014341 |
11 | 29a619a7a15182 |
12 | b2bb82b9724b1 |
13 | 43c78a1a277b3 |
14 | 1aaaa9bc0c513 |
15 | b8e23d7cd211 |
hex | 5b39f71b2345 |
100304517014341 has 16 divisors (see below), whose sum is σ = 101560333492800. Its totient is φ = 99057129523200.
The previous prime is 100304517014327. The next prime is 100304517014347. The reversal of 100304517014341 is 143410715403001.
It is a cyclic number.
It is not a de Polignac number, because 100304517014341 - 213 = 100304517006149 is a prime.
It is a super-2 number, since 2×1003045170143412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100304517014297 and 100304517014306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100304517014347) 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, 33283461 + ... + 36171781.
It is an arithmetic number, because the mean of its divisors is an integer number (6347520843300).
Almost surely, 2100304517014341 is an apocalyptic number.
It is an amenable number.
100304517014341 is a deficient number, since it is larger than the sum of its proper divisors (1255816478459).
100304517014341 is a wasteful number, since it uses less digits than its factorization.
100304517014341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2889780.
The product of its (nonzero) digits is 20160, while the sum is 34.
The spelling of 100304517014341 in words is "one hundred trillion, three hundred four billion, five hundred seventeen million, fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •