Base | Representation |
---|---|
bin | 1001011000110111101… |
… | …0010101101101000001 |
3 | 120102022220101020021000 |
4 | 2112031322111231001 |
5 | 10120312413430112 |
6 | 202033040322213 |
7 | 14440014036141 |
oct | 2261572255501 |
9 | 512286336230 |
10 | 161294670657 |
11 | 6244a70040a |
12 | 27315313369 |
13 | 12296559c33 |
14 | 7b41848921 |
15 | 42e04787dc |
hex | 258de95b41 |
161294670657 has 16 divisors (see below), whose sum is σ = 239011554880. Its totient is φ = 107504361216.
The previous prime is 161294670613. The next prime is 161294670659. The reversal of 161294670657 is 756076492161.
161294670657 is a `hidden beast` number, since 1 + 6 + 129 + 467 + 0 + 6 + 57 = 666.
161294670657 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 161294670657 - 27 = 161294670529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161294670659) by changing a digit.
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, 589408 + ... + 818529.
It is an arithmetic number, because the mean of its divisors is an integer number (14938222180).
Almost surely, 2161294670657 is an apocalyptic number.
It is an amenable number.
161294670657 is a deficient number, since it is larger than the sum of its proper divisors (77716884223).
161294670657 is a wasteful number, since it uses less digits than its factorization.
161294670657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1412189 (or 1412183 counting only the distinct ones).
The product of its (nonzero) digits is 3810240, while the sum is 54.
The spelling of 161294670657 in words is "one hundred sixty-one billion, two hundred ninety-four million, six hundred seventy thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •