Base | Representation |
---|---|
bin | 111010001110010001111… |
… | …001000101101110001101 |
3 | 112011111102220102210100110 |
4 | 322032101321011232031 |
5 | 1011023133411331131 |
6 | 12302021304550233 |
7 | 562032023453400 |
oct | 72162171055615 |
9 | 15144386383313 |
10 | 4001062214541 |
11 | 1302928349127 |
12 | 547523782379 |
13 | 2303b5ba9852 |
14 | db91c443d37 |
15 | 6e12437a646 |
hex | 3a391e45b8d |
4001062214541 has 24 divisors (see below), whose sum is σ = 6322818390624. Its totient is φ = 2243183124000.
The previous prime is 4001062214507. The next prime is 4001062214579. The reversal of 4001062214541 is 1454122601004.
It is not a de Polignac number, because 4001062214541 - 26 = 4001062214477 is a prime.
It is a super-2 number, since 2×40010622145412 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4001062214499 and 4001062214508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4001062214741) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 256766835 + ... + 256782416.
It is an arithmetic number, because the mean of its divisors is an integer number (263450766276).
Almost surely, 24001062214541 is an apocalyptic number.
It is an amenable number.
4001062214541 is a deficient number, since it is larger than the sum of its proper divisors (2321756176083).
4001062214541 is a wasteful number, since it uses less digits than its factorization.
4001062214541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 513549321 (or 513549314 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 4001062214541 its reverse (1454122601004), we get a palindrome (5455184815545).
The spelling of 4001062214541 in words is "four trillion, one billion, sixty-two million, two hundred fourteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •