Base | Representation |
---|---|
bin | 101110110011100100… |
… | …0110100001101001011 |
3 | 100121110000222100021000 |
4 | 1131213020310031023 |
5 | 3121323220041133 |
6 | 114101544550043 |
7 | 10155563051106 |
oct | 1354710641513 |
9 | 317400870230 |
10 | 100514612043 |
11 | 3969a97280a |
12 | 17592182323 |
13 | 962b30c701 |
14 | 4c1753b73d |
15 | 29344dc413 |
hex | 176723434b |
100514612043 has 16 divisors (see below), whose sum is σ = 148916448640. Its totient is φ = 67007080872.
The previous prime is 100514612021. The next prime is 100514612083. The reversal of 100514612043 is 340216415001.
It is a happy number.
100514612043 is a `hidden beast` number, since 1 + 0 + 0 + 5 + 1 + 4 + 612 + 0 + 43 = 666.
It is not a de Polignac number, because 100514612043 - 214 = 100514595659 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100514611998 and 100514612016.
It is not an unprimeable number, because it can be changed into a prime (100514612083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 811680 + ... + 927282.
It is an arithmetic number, because the mean of its divisors is an integer number (9307278040).
Almost surely, 2100514612043 is an apocalyptic number.
100514612043 is a deficient number, since it is larger than the sum of its proper divisors (48401836597).
100514612043 is a wasteful number, since it uses less digits than its factorization.
100514612043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147815 (or 147809 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 100514612043 in words is "one hundred billion, five hundred fourteen million, six hundred twelve thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •