Base | Representation |
---|---|
bin | 111010101011010001110… |
… | …110101111110100001101 |
3 | 112021110210221212221112112 |
4 | 322223101312233310031 |
5 | 1012030421212112141 |
6 | 12324211150113405 |
7 | 564213451312604 |
oct | 72532166576415 |
9 | 15243727787475 |
10 | 4032200113421 |
11 | 1315056932457 |
12 | 5515737ab865 |
13 | 233308c3199c |
14 | dd233a54a3b |
15 | 6ed47d247eb |
hex | 3aad1dafd0d |
4032200113421 has 4 divisors (see below), whose sum is σ = 4032207809052. Its totient is φ = 4032192417792.
The previous prime is 4032200113373. The next prime is 4032200113429. The reversal of 4032200113421 is 1243110022304.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3002807245321 + 1029392868100 = 1732861^2 + 1014590^2 .
It is a cyclic number.
It is not a de Polignac number, because 4032200113421 - 210 = 4032200112397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4032200113429) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2999540 + ... + 4130573.
It is an arithmetic number, because the mean of its divisors is an integer number (1008051952263).
Almost surely, 24032200113421 is an apocalyptic number.
It is an amenable number.
4032200113421 is a deficient number, since it is larger than the sum of its proper divisors (7695631).
4032200113421 is an equidigital number, since it uses as much as digits as its factorization.
4032200113421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7695630.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 4032200113421 its reverse (1243110022304), we get a palindrome (5275310135725).
The spelling of 4032200113421 in words is "four trillion, thirty-two billion, two hundred million, one hundred thirteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •