Base | Representation |
---|---|
bin | 111010110111001101100… |
… | …100100001110011000001 |
3 | 112022200212220211122120011 |
4 | 322313031210201303001 |
5 | 1012233141330133213 |
6 | 12334130421344521 |
7 | 565146124206412 |
oct | 72671544416301 |
9 | 15280786748504 |
10 | 4045013130433 |
11 | 131a531505810 |
12 | 553b4a868141 |
13 | 23459b656262 |
14 | ddacb629809 |
15 | 70347b3e03d |
hex | 3adcd921cc1 |
4045013130433 has 32 divisors (see below), whose sum is σ = 4761778544640. Its totient is φ = 3394740111360.
The previous prime is 4045013130409. The next prime is 4045013130451. The reversal of 4045013130433 is 3340313105404.
4045013130433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4045013130433 - 29 = 4045013129921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4045013130395 and 4045013130404.
It is not an unprimeable number, because it can be changed into a prime (4045013130493) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37300416 + ... + 37408702.
It is an arithmetic number, because the mean of its divisors is an integer number (148805579520).
Almost surely, 24045013130433 is an apocalyptic number.
It is an amenable number.
4045013130433 is a deficient number, since it is larger than the sum of its proper divisors (716765414207).
4045013130433 is a wasteful number, since it uses less digits than its factorization.
4045013130433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112137.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 4045013130433 its reverse (3340313105404), we get a palindrome (7385326235837).
The spelling of 4045013130433 in words is "four trillion, forty-five billion, thirteen million, one hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •