Base | Representation |
---|---|
bin | 111010001110010111001… |
… | …000001011011111010101 |
3 | 112011111200000201121201211 |
4 | 322032113020023133111 |
5 | 1011023323403301110 |
6 | 12302034123421421 |
7 | 562034141220205 |
oct | 72162710133725 |
9 | 15144600647654 |
10 | 4001150056405 |
11 | 1302972996007 |
12 | 547549084871 |
13 | 2303cb154398 |
14 | db929d8c405 |
15 | 6e12be2c98a |
hex | 3a39720b7d5 |
4001150056405 has 8 divisors (see below), whose sum is σ = 4801729163832. Its totient is φ = 3200687314368.
The previous prime is 4001150056339. The next prime is 4001150056433. The reversal of 4001150056405 is 5046500511004.
It can be written as a sum of positive squares in 4 ways, for example, as 29105042404 + 3972045014001 = 170602^2 + 1992999^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4001150056405 - 213 = 4001150048213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29015682 + ... + 29153251.
It is an arithmetic number, because the mean of its divisors is an integer number (600216145479).
Almost surely, 24001150056405 is an apocalyptic number.
It is an amenable number.
4001150056405 is a deficient number, since it is larger than the sum of its proper divisors (800579107427).
4001150056405 is a wasteful number, since it uses less digits than its factorization.
4001150056405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58182695.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 4001150056405 its reverse (5046500511004), we get a palindrome (9047650567409).
The spelling of 4001150056405 in words is "four trillion, one billion, one hundred fifty million, fifty-six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •