Base | Representation |
---|---|
bin | 1011000110100… |
… | …1101010000001 |
3 | 10020122000012000 |
4 | 2301221222001 |
5 | 43410220423 |
6 | 4342054213 |
7 | 1103560632 |
oct | 261515201 |
9 | 106560160 |
10 | 46570113 |
11 | 243188a7 |
12 | 1371a369 |
13 | 98571a5 |
14 | 6283889 |
15 | 414d843 |
hex | 2c69a81 |
46570113 has 8 divisors (see below), whose sum is σ = 68992800. Its totient is φ = 31046724.
The previous prime is 46570109. The next prime is 46570129. The reversal of 46570113 is 31107564.
46570113 is a `hidden beast` number, since 4 + 657 + 0 + 1 + 1 + 3 = 666.
It is not a de Polignac number, because 46570113 - 22 = 46570109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1724819 = 46570113 / (4 + 6 + 5 + 7 + 0 + 1 + 1 + 3).
It is not an unprimeable number, because it can be changed into a prime (46570133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 862383 + ... + 862436.
It is an arithmetic number, because the mean of its divisors is an integer number (8624100).
Almost surely, 246570113 is an apocalyptic number.
It is an amenable number.
46570113 is a deficient number, since it is larger than the sum of its proper divisors (22422687).
46570113 is a wasteful number, since it uses less digits than its factorization.
46570113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1724828 (or 1724822 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 46570113 is about 6824.2298466567. The cubic root of 46570113 is about 359.7789615333.
Adding to 46570113 its reverse (31107564), we get a palindrome (77677677).
The spelling of 46570113 in words is "forty-six million, five hundred seventy thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •