Base | Representation |
---|---|
bin | 101111000010001100… |
… | …1011011000000100111 |
3 | 100122201020200021012000 |
4 | 1132010121123000213 |
5 | 3123324402121201 |
6 | 114222402300343 |
7 | 10204003423440 |
oct | 1360431330047 |
9 | 318636607160 |
10 | 101005504551 |
11 | 39921a795a6 |
12 | 176aa6576b3 |
13 | 96a8c26253 |
14 | 4c628022c7 |
15 | 2962656d86 |
hex | 178465b027 |
101005504551 has 16 divisors (see below), whose sum is σ = 171014611200. Its totient is φ = 57717431064.
The previous prime is 101005504529. The next prime is 101005504597. The reversal of 101005504551 is 155405500101.
101005504551 is a `hidden beast` number, since 1 + 0 + 100 + 5 + 5 + 0 + 4 + 551 = 666.
It is not a de Polignac number, because 101005504551 - 214 = 101005488167 is a prime.
It is a super-2 number, since 2×1010055045512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101005504051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 267210141 + ... + 267210518.
It is an arithmetic number, because the mean of its divisors is an integer number (10688413200).
Almost surely, 2101005504551 is an apocalyptic number.
101005504551 is a deficient number, since it is larger than the sum of its proper divisors (70009106649).
101005504551 is an equidigital number, since it uses as much as digits as its factorization.
101005504551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534420675 (or 534420669 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 27.
The spelling of 101005504551 in words is "one hundred one billion, five million, five hundred four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •