Base | Representation |
---|---|
bin | 111101011101000101000… |
… | …010110011000101011001 |
3 | 112221201120212210200010021 |
4 | 331131011002303011121 |
5 | 1023142412432312101 |
6 | 12552023121350441 |
7 | 614052430014043 |
oct | 75350502630531 |
9 | 15851525720107 |
10 | 4223111213401 |
11 | 1389014202533 |
12 | 582573498421 |
13 | 2483122454c2 |
14 | 1085849bca93 |
15 | 74cbd3ab5a1 |
hex | 3d7450b3159 |
4223111213401 has 8 divisors (see below), whose sum is σ = 4226782210560. Its totient is φ = 4219440721392.
The previous prime is 4223111213353. The next prime is 4223111213417. The reversal of 4223111213401 is 1043121113224.
4223111213401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4223111213401 - 217 = 4223111082329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4223111913401) 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, 17687451 + ... + 17924623.
It is an arithmetic number, because the mean of its divisors is an integer number (528347776320).
Almost surely, 24223111213401 is an apocalyptic number.
It is an amenable number.
4223111213401 is a deficient number, since it is larger than the sum of its proper divisors (3670997159).
4223111213401 is a wasteful number, since it uses less digits than its factorization.
4223111213401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252575.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 4223111213401 its reverse (1043121113224), we get a palindrome (5266232326625).
The spelling of 4223111213401 in words is "four trillion, two hundred twenty-three billion, one hundred eleven million, two hundred thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •