Base | Representation |
---|---|
bin | 1001100000011110101… |
… | …0010000001010111001 |
3 | 120121121020220020100012 |
4 | 2120013222100022321 |
5 | 10134003320232131 |
6 | 203011444351305 |
7 | 14541435631064 |
oct | 2300752201271 |
9 | 517536806305 |
10 | 163337274041 |
11 | 632a86a6587 |
12 | 277a53a5535 |
13 | 1253079caa6 |
14 | 7c96c338db |
15 | 43ae95452b |
hex | 2607a902b9 |
163337274041 has 4 divisors (see below), whose sum is σ = 163521420672. Its totient is φ = 163153127412.
The previous prime is 163337274029. The next prime is 163337274109. The reversal of 163337274041 is 140472733361.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 163337274041 - 230 = 162263532217 is a prime.
It is a super-2 number, since 2×1633372740412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 163337274041.
It is not an unprimeable number, because it can be changed into a prime (163337274011) 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, 92071985 + ... + 92073758.
It is an arithmetic number, because the mean of its divisors is an integer number (40880355168).
Almost surely, 2163337274041 is an apocalyptic number.
It is an amenable number.
163337274041 is a deficient number, since it is larger than the sum of its proper divisors (184146631).
163337274041 is an equidigital number, since it uses as much as digits as its factorization.
163337274041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184146630.
The product of its (nonzero) digits is 254016, while the sum is 41.
The spelling of 163337274041 in words is "one hundred sixty-three billion, three hundred thirty-seven million, two hundred seventy-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •