Base | Representation |
---|---|
bin | 1011101011101101011… |
… | …01100011001010011011 |
3 | 1102101010220100021111111 |
4 | 11311312231203022123 |
5 | 23034103421014043 |
6 | 504224513041151 |
7 | 41000436251005 |
oct | 5656655431233 |
9 | 1371126307444 |
10 | 401423610523 |
11 | 145274188021 |
12 | 6596bb561b7 |
13 | 2bb14565730 |
14 | 1560129d375 |
15 | a6968a409d |
hex | 5d76b6329b |
401423610523 has 4 divisors (see below), whose sum is σ = 432302349808. Its totient is φ = 370544871240.
The previous prime is 401423610517. The next prime is 401423610559. The reversal of 401423610523 is 325016324104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 401423610523 - 25 = 401423610491 is a prime.
It is a super-2 number, since 2×4014236105232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401423610563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15439369623 + ... + 15439369648.
It is an arithmetic number, because the mean of its divisors is an integer number (108075587452).
Almost surely, 2401423610523 is an apocalyptic number.
401423610523 is a deficient number, since it is larger than the sum of its proper divisors (30878739285).
401423610523 is a wasteful number, since it uses less digits than its factorization.
401423610523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30878739284.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 401423610523 its reverse (325016324104), we get a palindrome (726439934627).
The spelling of 401423610523 in words is "four hundred one billion, four hundred twenty-three million, six hundred ten thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •