Base | Representation |
---|---|
bin | 101110110100110001… |
… | …0111000101010101111 |
3 | 100121112211222021210121 |
4 | 1131221202320222233 |
5 | 3121414040003440 |
6 | 114105550345411 |
7 | 10156563254515 |
oct | 1355142705257 |
9 | 317484867717 |
10 | 100555000495 |
11 | 397107491a4 |
12 | 175a37bb267 |
13 | 96367b0cc1 |
14 | 4c1ca524b5 |
15 | 2937d1934a |
hex | 17698b8aaf |
100555000495 has 4 divisors (see below), whose sum is σ = 120666000600. Its totient is φ = 80444000392.
The previous prime is 100555000457. The next prime is 100555000499. The reversal of 100555000495 is 594000555001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100555000495 - 213 = 100554992303 is a prime.
It is a super-2 number, since 2×1005550004952 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100555000495.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100555000499) 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, 10055500045 + ... + 10055500054.
It is an arithmetic number, because the mean of its divisors is an integer number (30166500150).
Almost surely, 2100555000495 is an apocalyptic number.
100555000495 is a deficient number, since it is larger than the sum of its proper divisors (20111000105).
100555000495 is an equidigital number, since it uses as much as digits as its factorization.
100555000495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20111000104.
The product of its (nonzero) digits is 22500, while the sum is 34.
Adding to 100555000495 its reverse (594000555001), we get a palindrome (694555555496).
The spelling of 100555000495 in words is "one hundred billion, five hundred fifty-five million, four hundred ninety-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •