Base | Representation |
---|---|
bin | 111100010101000… |
… | …001001110101111 |
3 | 2121112112012012122 |
4 | 330111001032233 |
5 | 4033102034043 |
6 | 244233423155 |
7 | 34040034203 |
oct | 7425011657 |
9 | 2545465178 |
10 | 1012143023 |
11 | 47a368041 |
12 | 242b6aabb |
13 | 1318cc2c8 |
14 | 985ccb03 |
15 | 5dcce368 |
hex | 3c5413af |
1012143023 has 4 divisors (see below), whose sum is σ = 1024955040. Its totient is φ = 999331008.
The previous prime is 1012143019. The next prime is 1012143043. The reversal of 1012143023 is 3203412101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3203412101 = 23 ⋅139278787.
It is a cyclic number.
It is not a de Polignac number, because 1012143023 - 22 = 1012143019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012142992 and 1012143010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012143043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6405890 + ... + 6406047.
It is an arithmetic number, because the mean of its divisors is an integer number (256238760).
Almost surely, 21012143023 is an apocalyptic number.
1012143023 is a deficient number, since it is larger than the sum of its proper divisors (12812017).
1012143023 is an equidigital number, since it uses as much as digits as its factorization.
1012143023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12812016.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1012143023 is about 31814.1953064980. The cubic root of 1012143023 is about 1004.0314003052.
Adding to 1012143023 its reverse (3203412101), we get a palindrome (4215555124).
The spelling of 1012143023 in words is "one billion, twelve million, one hundred forty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •