Base | Representation |
---|---|
bin | 101110110011010010… |
… | …0100011001010011011 |
3 | 100121102101002100010012 |
4 | 1131212210203022123 |
5 | 3121313301330201 |
6 | 114101005112135 |
7 | 10155416203661 |
oct | 1354644431233 |
9 | 317371070105 |
10 | 100505105051 |
11 | 39695569a9a |
12 | 1758ab5864b |
13 | 9629361380 |
14 | 4c16184c31 |
15 | 29337605bb |
hex | 176692329b |
100505105051 has 16 divisors (see below), whose sum is σ = 114614849664. Its totient is φ = 87307705344.
The previous prime is 100505105047. The next prime is 100505105083. The reversal of 100505105051 is 150501505001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 100505105051 - 22 = 100505105047 is a prime.
It is a super-2 number, since 2×1005051050512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100505105551) 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, 3058430 + ... + 3091116.
It is an arithmetic number, because the mean of its divisors is an integer number (7163428104).
Almost surely, 2100505105051 is an apocalyptic number.
100505105051 is a deficient number, since it is larger than the sum of its proper divisors (14109744613).
100505105051 is a wasteful number, since it uses less digits than its factorization.
100505105051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46630.
The product of its (nonzero) digits is 625, while the sum is 23.
The spelling of 100505105051 in words is "one hundred billion, five hundred five million, one hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •