Base | Representation |
---|---|
bin | 1000011101010101… |
… | …10010001101000001 |
3 | 102201110210221201121 |
4 | 10032222302031001 |
5 | 33300003022001 |
6 | 2030334432241 |
7 | 220350256435 |
oct | 41652621501 |
9 | 12643727647 |
10 | 4541064001 |
11 | 1a20348661 |
12 | a68962681 |
13 | 574a53726 |
14 | 3111589c5 |
15 | 1b8a006a1 |
hex | 10eab2341 |
4541064001 has 4 divisors (see below), whose sum is σ = 4637682432. Its totient is φ = 4444445572.
The previous prime is 4541063993. The next prime is 4541064013. The reversal of 4541064001 is 1004601454.
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 4541064001 - 23 = 4541063993 is a prime.
It is a super-2 number, since 2×45410640012 = 41242524522356256002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4541064071) 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, 48309145 + ... + 48309238.
It is an arithmetic number, because the mean of its divisors is an integer number (1159420608).
Almost surely, 24541064001 is an apocalyptic number.
It is an amenable number.
4541064001 is a deficient number, since it is larger than the sum of its proper divisors (96618431).
4541064001 is an equidigital number, since it uses as much as digits as its factorization.
4541064001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96618430.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 4541064001 is about 67387.4172305186. The cubic root of 4541064001 is about 1655.9702906105.
Adding to 4541064001 its reverse (1004601454), we get a palindrome (5545665455).
The spelling of 4541064001 in words is "four billion, five hundred forty-one million, sixty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •