Base | Representation |
---|---|
bin | 1000100101000011… |
… | …01010011001100001 |
3 | 102212222120221120202 |
4 | 10102201222121201 |
5 | 33413040002401 |
6 | 2041005514545 |
7 | 222064332461 |
oct | 42241523141 |
9 | 12788527522 |
10 | 4605781601 |
11 | 1a53930983 |
12 | a86572a55 |
13 | 585292a75 |
14 | 3199a3ba1 |
15 | 1be53606b |
hex | 11286a661 |
4605781601 has 4 divisors (see below), whose sum is σ = 4606004400. Its totient is φ = 4605558804.
The previous prime is 4605781589. The next prime is 4605781633. The reversal of 4605781601 is 1061875064.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4605781601 - 222 = 4601587297 is a prime.
It is a super-2 number, since 2×46057816012 = 42426448312220246402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4605781651) 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 3 ways as a sum of consecutive naturals, for example, 76811 + ... + 122928.
It is an arithmetic number, because the mean of its divisors is an integer number (1151501100).
Almost surely, 24605781601 is an apocalyptic number.
It is an amenable number.
4605781601 is a deficient number, since it is larger than the sum of its proper divisors (222799).
4605781601 is a wasteful number, since it uses less digits than its factorization.
4605781601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222798.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 4605781601 is about 67865.9089749780. The cubic root of 4605781601 is about 1663.7999753065.
The spelling of 4605781601 in words is "four billion, six hundred five million, seven hundred eighty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •