Base | Representation |
---|---|
bin | 100101000100001010101010… |
… | …010010000001111011111010 |
3 | 210101011222202010021000102211 |
4 | 211010022222102001323322 |
5 | 132331310231133340001 |
6 | 1334411341350445334 |
7 | 46223243005206445 |
oct | 4504125222017372 |
9 | 711158663230384 |
10 | 163014045605626 |
11 | 47a39960a82396 |
12 | 1634926a06384a |
13 | 6cc620a410377 |
14 | 2c37cc99ca65c |
15 | 13ca581c07351 |
hex | 9442aa481efa |
163014045605626 has 4 divisors (see below), whose sum is σ = 244521068408442. Its totient is φ = 81507022802812.
The previous prime is 163014045605603. The next prime is 163014045605647. The reversal of 163014045605626 is 626506540410361.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 138108446322025 + 24905599283601 = 11751955^2 + 4990551^2 .
It is a super-2 number, since 2×1630140456056262 (a number of 29 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 163014045605626.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40753511401405 + ... + 40753511401408.
Almost surely, 2163014045605626 is an apocalyptic number.
163014045605626 is a deficient number, since it is larger than the sum of its proper divisors (81507022802816).
163014045605626 is an equidigital number, since it uses as much as digits as its factorization.
163014045605626 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81507022802815.
The product of its (nonzero) digits is 3110400, while the sum is 49.
The spelling of 163014045605626 in words is "one hundred sixty-three trillion, fourteen billion, forty-five million, six hundred five thousand, six hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •