Base | Representation |
---|---|
bin | 111010101011001100000… |
… | …101001001010001011101 |
3 | 112021110120012120110210202 |
4 | 322223030011021101131 |
5 | 1012030221411140123 |
6 | 12324153405313245 |
7 | 564211163625425 |
oct | 72531405112135 |
9 | 15243505513722 |
10 | 4032103224413 |
11 | 13150071762a0 |
12 | 551547265825 |
13 | 2332c1b3a204 |
14 | dd224c33485 |
15 | 6ed3e586a28 |
hex | 3aacc14945d |
4032103224413 has 8 divisors (see below), whose sum is σ = 4399242382080. Its totient is φ = 3665061453280.
The previous prime is 4032103224371. The next prime is 4032103224427. The reversal of 4032103224413 is 3144223012304.
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 4032103224413 - 220 = 4032102175837 is a prime.
It is a super-2 number, since 2×40321032244132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4032103224473) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24260045 + ... + 24425682.
It is an arithmetic number, because the mean of its divisors is an integer number (549905297760).
Almost surely, 24032103224413 is an apocalyptic number.
It is an amenable number.
4032103224413 is a deficient number, since it is larger than the sum of its proper divisors (367139157667).
4032103224413 is a wasteful number, since it uses less digits than its factorization.
4032103224413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48693267.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 4032103224413 its reverse (3144223012304), we get a palindrome (7176326236717).
The spelling of 4032103224413 in words is "four trillion, thirty-two billion, one hundred three million, two hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •