Base | Representation |
---|---|
bin | 111101001000110001101… |
… | …010011011111001111110 |
3 | 112212122022121021102211000 |
4 | 331020301222123321332 |
5 | 1022313241133122142 |
6 | 12534020012111130 |
7 | 612351260113665 |
oct | 75106152337176 |
9 | 15778277242730 |
10 | 4201311223422 |
11 | 137a847726395 |
12 | 57a2aa7654a6 |
13 | 246249982251 |
14 | 1074b7623ddc |
15 | 744445da14c |
hex | 3d231a9be7e |
4201311223422 has 32 divisors (see below), whose sum is σ = 9827628595200. Its totient is φ = 1326729859704.
The previous prime is 4201311223381. The next prime is 4201311223427. The reversal of 4201311223422 is 2243221131024.
4201311223422 is a `hidden beast` number, since 4 + 2 + 0 + 1 + 3 + 11 + 223 + 422 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4201311223427) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2047421598 + ... + 2047423649.
It is an arithmetic number, because the mean of its divisors is an integer number (307113393600).
Almost surely, 24201311223422 is an apocalyptic number.
4201311223422 is an abundant number, since it is smaller than the sum of its proper divisors (5626317371778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4201311223422 is a wasteful number, since it uses less digits than its factorization.
4201311223422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4094845277 (or 4094845271 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 4201311223422 its reverse (2243221131024), we get a palindrome (6444532354446).
The spelling of 4201311223422 in words is "four trillion, two hundred one billion, three hundred eleven million, two hundred twenty-three thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •