Base | Representation |
---|---|
bin | 100101001010010100001000… |
… | …111110010010101110100111 |
3 | 210102200101021112222222100120 |
4 | 211022110020332102232213 |
5 | 132410221014002441210 |
6 | 1335333413242413023 |
7 | 46265620563300522 |
oct | 4512241076225647 |
9 | 712611245888316 |
10 | 163436541062055 |
11 | 48092058714098 |
12 | 163b711ab01173 |
13 | 7026ccc424671 |
14 | 2c50529661bb9 |
15 | 13d655d49b270 |
hex | 94a508f92ba7 |
163436541062055 has 32 divisors (see below), whose sum is σ = 262436737771200. Its totient is φ = 86853883917312.
The previous prime is 163436541061867. The next prime is 163436541062101. The reversal of 163436541062055 is 550260145634361.
It is a happy number.
It is not a de Polignac number, because 163436541062055 - 215 = 163436541029287 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 163436541061989 and 163436541062007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9807760 + ... + 20568549.
It is an arithmetic number, because the mean of its divisors is an integer number (8201148055350).
Almost surely, 2163436541062055 is an apocalyptic number.
163436541062055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
163436541062055 is a deficient number, since it is larger than the sum of its proper divisors (99000196709145).
163436541062055 is a wasteful number, since it uses less digits than its factorization.
163436541062055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30377603.
The product of its (nonzero) digits is 7776000, while the sum is 51.
The spelling of 163436541062055 in words is "one hundred sixty-three trillion, four hundred thirty-six billion, five hundred forty-one million, sixty-two thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •