Base | Representation |
---|---|
bin | 10011110100100111… |
… | …10010001000111111 |
3 | 1000110122200121201000 |
4 | 21322103302020333 |
5 | 133243314103210 |
6 | 4515553421343 |
7 | 524501002134 |
oct | 117223621077 |
9 | 30418617630 |
10 | 10641941055 |
11 | 4571109909 |
12 | 208bb6a853 |
13 | 10079ac255 |
14 | 72d50658b |
15 | 424412ac0 |
hex | 27a4f223f |
10641941055 has 16 divisors (see below), whose sum is σ = 18919006560. Its totient is φ = 5675701824.
The previous prime is 10641941041. The next prime is 10641941069. The reversal of 10641941055 is 55014914601.
10641941055 is a `hidden beast` number, since 1 + 0 + 641 + 9 + 4 + 1 + 0 + 5 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (10641941041) and next prime (10641941069).
It is not a de Polignac number, because 10641941055 - 24 = 10641941039 is a prime.
It is a super-2 number, since 2×106419410552 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 39414462 + ... + 39414731.
It is an arithmetic number, because the mean of its divisors is an integer number (1182437910).
Almost surely, 210641941055 is an apocalyptic number.
10641941055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10641941055 is a deficient number, since it is larger than the sum of its proper divisors (8277065505).
10641941055 is an equidigital number, since it uses as much as digits as its factorization.
10641941055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78829207 (or 78829201 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 10641941055 in words is "ten billion, six hundred forty-one million, nine hundred forty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •