Base | Representation |
---|---|
bin | 1011000111011… |
… | …0000011100101 |
3 | 10020201120212001 |
4 | 2301312003211 |
5 | 43413332101 |
6 | 4343125301 |
7 | 1104161665 |
oct | 261660345 |
9 | 106646761 |
10 | 46620901 |
11 | 24352a78 |
12 | 13743831 |
13 | 9874342 |
14 | 62981a5 |
15 | 415d901 |
hex | 2c760e5 |
46620901 has 8 divisors (see below), whose sum is σ = 47842784. Its totient is φ = 45405360.
The previous prime is 46620883. The next prime is 46620911. The reversal of 46620901 is 10902664.
46620901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-46620901 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 46620901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46620911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15706 + ... + 18436.
It is an arithmetic number, because the mean of its divisors is an integer number (5980348).
Almost surely, 246620901 is an apocalyptic number.
It is an amenable number.
46620901 is a deficient number, since it is larger than the sum of its proper divisors (1221883).
46620901 is a wasteful number, since it uses less digits than its factorization.
46620901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3171.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 46620901 is about 6827.9499851712. The cubic root of 46620901 is about 359.9097021470.
The spelling of 46620901 in words is "forty-six million, six hundred twenty thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •