Base | Representation |
---|---|
bin | 1011101010111111110… |
… | …11101001011011001111 |
3 | 1102100011021012111200120 |
4 | 11311133323221123033 |
5 | 23032313101231343 |
6 | 504122541400023 |
7 | 40655115624510 |
oct | 5653773513317 |
9 | 1370137174616 |
10 | 401041430223 |
11 | 145098483335 |
12 | 65883b69013 |
13 | 2ba83323045 |
14 | 155a6616a07 |
15 | a673060683 |
hex | 5d5fee96cf |
401041430223 has 8 divisors (see below), whose sum is σ = 611110750848. Its totient is φ = 229166531544.
The previous prime is 401041430213. The next prime is 401041430233. The reversal of 401041430223 is 322034140104.
It is an interprime number because it is at equal distance from previous prime (401041430213) and next prime (401041430233).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 401041430223 - 25 = 401041430191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 401041430193 and 401041430202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401041430203) 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, 9548605461 + ... + 9548605502.
It is an arithmetic number, because the mean of its divisors is an integer number (76388843856).
Almost surely, 2401041430223 is an apocalyptic number.
401041430223 is a deficient number, since it is larger than the sum of its proper divisors (210069320625).
401041430223 is a wasteful number, since it uses less digits than its factorization.
401041430223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19097210973.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 401041430223 its reverse (322034140104), we get a palindrome (723075570327).
The spelling of 401041430223 in words is "four hundred one billion, forty-one million, four hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •