Base | Representation |
---|---|
bin | 111100011000110… |
… | …100111110101111 |
3 | 2121121101220202102 |
4 | 330120310332233 |
5 | 4033331011143 |
6 | 244311045315 |
7 | 34051363040 |
oct | 7430647657 |
9 | 2547356672 |
10 | 1013141423 |
11 | 47a98a168 |
12 | 24337083b |
13 | 131b8b888 |
14 | 987ac8c7 |
15 | 5de2a0b8 |
hex | 3c634faf |
1013141423 has 4 divisors (see below), whose sum is σ = 1157875920. Its totient is φ = 868406928.
The previous prime is 1013141383. The next prime is 1013141431. The reversal of 1013141423 is 3241413101.
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 1013141423 - 216 = 1013075887 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013141395 and 1013141404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013141453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72367238 + ... + 72367251.
It is an arithmetic number, because the mean of its divisors is an integer number (289468980).
Almost surely, 21013141423 is an apocalyptic number.
1013141423 is a deficient number, since it is larger than the sum of its proper divisors (144734497).
1013141423 is an equidigital number, since it uses as much as digits as its factorization.
1013141423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144734496.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 1013141423 is about 31829.8825476941. The cubic root of 1013141423 is about 1004.3614246539.
Adding to 1013141423 its reverse (3241413101), we get a palindrome (4254554524).
The spelling of 1013141423 in words is "one billion, thirteen million, one hundred forty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •