Base | Representation |
---|---|
bin | 1000011111101101… |
… | …11111001011100101 |
3 | 102202212101211210011 |
4 | 10033312333023211 |
5 | 33320111240401 |
6 | 2032330530221 |
7 | 221012126002 |
oct | 41766771345 |
9 | 12685354704 |
10 | 4561040101 |
11 | 1a30651a32 |
12 | a73596971 |
13 | 578c28cc7 |
14 | 313a788a9 |
15 | 1ba649451 |
hex | 10fdbf2e5 |
4561040101 has 4 divisors (see below), whose sum is σ = 4603666752. Its totient is φ = 4518413452.
The previous prime is 4561040059. The next prime is 4561040111. The reversal of 4561040101 is 1010401654.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1010401654 = 2 ⋅505200827.
It is a cyclic number.
It is not a de Polignac number, because 4561040101 - 29 = 4561039589 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 (4561040111) 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, 21313165 + ... + 21313378.
It is an arithmetic number, because the mean of its divisors is an integer number (1150916688).
Almost surely, 24561040101 is an apocalyptic number.
It is an amenable number.
4561040101 is a deficient number, since it is larger than the sum of its proper divisors (42626651).
4561040101 is a wasteful number, since it uses less digits than its factorization.
4561040101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42626650.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 4561040101 is about 67535.4729086870. The cubic root of 4561040101 is about 1658.3949382522.
Adding to 4561040101 its reverse (1010401654), we get a palindrome (5571441755).
The spelling of 4561040101 in words is "four billion, five hundred sixty-one million, forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •