Base | Representation |
---|---|
bin | 1011101011100001000… |
… | …11100000000110000111 |
3 | 1102100212200222020020120 |
4 | 11311300203200012013 |
5 | 23033401000010343 |
6 | 504210343033023 |
7 | 40665043243464 |
oct | 5656043400607 |
9 | 1370780866216 |
10 | 401320313223 |
11 | 145220944255 |
12 | 6594143b773 |
13 | 2bac903917b |
14 | 155d169066b |
15 | a68c79c683 |
hex | 5d708e0187 |
401320313223 has 16 divisors (see below), whose sum is σ = 540597492960. Its totient is φ = 264808267776.
The previous prime is 401320313159. The next prime is 401320313257. The reversal of 401320313223 is 322313023104.
It is not a de Polignac number, because 401320313223 - 26 = 401320313159 is a prime.
It is a super-2 number, since 2×4013203132232 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401320313193 and 401320313202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401320313293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1536658 + ... + 1778751.
It is an arithmetic number, because the mean of its divisors is an integer number (33787343310).
Almost surely, 2401320313223 is an apocalyptic number.
401320313223 is a deficient number, since it is larger than the sum of its proper divisors (139277179737).
401320313223 is a wasteful number, since it uses less digits than its factorization.
401320313223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3315826.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 401320313223 its reverse (322313023104), we get a palindrome (723633336327).
The spelling of 401320313223 in words is "four hundred one billion, three hundred twenty million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •