Base | Representation |
---|---|
bin | 10011100100110110101… |
… | …01100110101100010001 |
3 | 2101022011010010121210222 |
4 | 21302123111212230101 |
5 | 42010011440431121 |
6 | 1232555311002425 |
7 | 66411114265013 |
oct | 11623325465421 |
9 | 2338133117728 |
10 | 672621030161 |
11 | 23a2910443a3 |
12 | aa437509415 |
13 | 4b5740cc082 |
14 | 247ab0141b3 |
15 | 1276a6150ab |
hex | 9c9b566b11 |
672621030161 has 4 divisors (see below), whose sum is σ = 678573428772. Its totient is φ = 666668631552.
The previous prime is 672621030127. The next prime is 672621030173. The reversal of 672621030161 is 161030126276.
672621030161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 259660565761 + 412960464400 = 509569^2 + 642620^2 .
It is a cyclic number.
It is not a de Polignac number, because 672621030161 - 222 = 672616835857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (672621030101) 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, 2976199136 + ... + 2976199361.
It is an arithmetic number, because the mean of its divisors is an integer number (169643357193).
Almost surely, 2672621030161 is an apocalyptic number.
It is an amenable number.
672621030161 is a deficient number, since it is larger than the sum of its proper divisors (5952398611).
672621030161 is a wasteful number, since it uses less digits than its factorization.
672621030161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5952398610.
The product of its (nonzero) digits is 18144, while the sum is 35.
The spelling of 672621030161 in words is "six hundred seventy-two billion, six hundred twenty-one million, thirty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •