Base | Representation |
---|---|
bin | 111100011001000… |
… | …110000100011111 |
3 | 2121121112110210000 |
4 | 330121012010133 |
5 | 4033340231143 |
6 | 244312345343 |
7 | 34052104110 |
oct | 7431060437 |
9 | 2547473700 |
10 | 1013211423 |
11 | 47aa27814 |
12 | 2433a5253 |
13 | 131bb46b3 |
14 | 987ca207 |
15 | 5de40bd3 |
hex | 3c64611f |
1013211423 has 80 divisors (see below), whose sum is σ = 1835173120. Its totient is φ = 544195584.
The previous prime is 1013211413. The next prime is 1013211469. The reversal of 1013211423 is 3241123101.
1013211423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1013211423 - 25 = 1013211391 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013211396 and 1013211405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013211413) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 1755711 + ... + 1756287.
It is an arithmetic number, because the mean of its divisors is an integer number (22939664).
Almost surely, 21013211423 is an apocalyptic number.
1013211423 is a deficient number, since it is larger than the sum of its proper divisors (821961697).
1013211423 is a wasteful number, since it uses less digits than its factorization.
1013211423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778 (or 769 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 1013211423 is about 31830.9821243392. The cubic root of 1013211423 is about 1004.3845552453.
Adding to 1013211423 its reverse (3241123101), we get a palindrome (4254334524).
The spelling of 1013211423 in words is "one billion, thirteen million, two hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •