Base | Representation |
---|---|
bin | 1001011101011011111110… |
… | …1001011000110001000111 |
3 | 1100211100122122112120212020 |
4 | 2113112333221120301013 |
5 | 2330403411231334343 |
6 | 34042145555454223 |
7 | 2122320452524230 |
oct | 227267751306107 |
9 | 40740578476766 |
10 | 10401331121223 |
11 | 33501a828a4a9 |
12 | 11bba208b7373 |
13 | 5a5ac24a9c53 |
14 | 27d5d9dd4087 |
15 | 130868627b83 |
hex | 975bfa58c47 |
10401331121223 has 64 divisors (see below), whose sum is σ = 16537426821120. Its totient is φ = 5689297958400.
The previous prime is 10401331121221. The next prime is 10401331121297. The reversal of 10401331121223 is 32212113310401.
It is not a de Polignac number, because 10401331121223 - 21 = 10401331121221 is a prime.
It is a super-2 number, since 2×104013311212232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10401331121193 and 10401331121202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10401331121221) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 106761993 + ... + 106859373.
It is an arithmetic number, because the mean of its divisors is an integer number (258397294080).
Almost surely, 210401331121223 is an apocalyptic number.
10401331121223 is a deficient number, since it is larger than the sum of its proper divisors (6136095699897).
10401331121223 is a wasteful number, since it uses less digits than its factorization.
10401331121223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98928.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10401331121223 its reverse (32212113310401), we get a palindrome (42613444431624).
The spelling of 10401331121223 in words is "ten trillion, four hundred one billion, three hundred thirty-one million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •