Base | Representation |
---|---|
bin | 101011001110100111… |
… | …100110100100100101 |
3 | 11102210211012021211100 |
4 | 223032213212210211 |
5 | 1230030014123221 |
6 | 33153455230313 |
7 | 3232143600504 |
oct | 531647464445 |
9 | 142724167740 |
10 | 46416161061 |
11 | 18759792896 |
12 | 8bb4818399 |
13 | 44b942a87a |
14 | 236478a83b |
15 | 1319e26926 |
hex | ace9e6925 |
46416161061 has 6 divisors (see below), whose sum is σ = 67045565990. Its totient is φ = 30944107368.
The previous prime is 46416161059. The next prime is 46416161063. The reversal of 46416161061 is 16016161464.
46416161061 is a `hidden beast` number, since 4 + 641 + 6 + 1 + 6 + 1 + 0 + 6 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (46416161059) and next prime (46416161063).
It can be written as a sum of positive squares in only one way, i.e., 43409722500 + 3006438561 = 208350^2 + 54831^2 .
It is not a de Polignac number, because 46416161061 - 21 = 46416161059 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46416161063) 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 5 ways as a sum of consecutive naturals, for example, 2578675606 + ... + 2578675623.
Almost surely, 246416161061 is an apocalyptic number.
It is an amenable number.
46416161061 is a deficient number, since it is larger than the sum of its proper divisors (20629404929).
46416161061 is a wasteful number, since it uses less digits than its factorization.
46416161061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5157351235 (or 5157351232 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The spelling of 46416161061 in words is "forty-six billion, four hundred sixteen million, one hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •