Base | Representation |
---|---|
bin | 100000000011100010101… |
… | …1010111100001011000001 |
3 | 120121011202120121100200110 |
4 | 1000013011122330023001 |
5 | 1034140234313332121 |
6 | 13211532423341533 |
7 | 633204130106046 |
oct | 100070532741301 |
9 | 16534676540613 |
10 | 4405653652161 |
11 | 14494776a4573 |
12 | 5b1a185b18a9 |
13 | 25c5b3827a88 |
14 | 1133403151cd |
15 | 79903dc4d76 |
hex | 401c56bc2c1 |
4405653652161 has 8 divisors (see below), whose sum is σ = 5875968378784. Its totient is φ = 2936220680160.
The previous prime is 4405653652129. The next prime is 4405653652201. The reversal of 4405653652161 is 1612563565044.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4405653652161 - 25 = 4405653652129 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4405653652161.
It is not an unprimeable number, because it can be changed into a prime (4405653650161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 220426996 + ... + 220446981.
It is an arithmetic number, because the mean of its divisors is an integer number (734496047348).
Almost surely, 24405653652161 is an apocalyptic number.
It is an amenable number.
4405653652161 is a deficient number, since it is larger than the sum of its proper divisors (1470314726623).
4405653652161 is a wasteful number, since it uses less digits than its factorization.
4405653652161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440877311.
The product of its (nonzero) digits is 2592000, while the sum is 48.
The spelling of 4405653652161 in words is "four trillion, four hundred five billion, six hundred fifty-three million, six hundred fifty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •