Base | Representation |
---|---|
bin | 111100001101000… |
… | …000100010001111 |
3 | 2121101120111112212 |
4 | 330031000202033 |
5 | 4032032334043 |
6 | 244120421035 |
7 | 34013136563 |
oct | 7415004217 |
9 | 2541514485 |
10 | 1010043023 |
11 | 479163300 |
12 | 24231777b |
13 | 1313454c2 |
14 | 982036a3 |
15 | 5da17018 |
hex | 3c34088f |
1010043023 has 24 divisors (see below), whose sum is σ = 1163420160. Its totient is φ = 875120400.
The previous prime is 1010042993. The next prime is 1010043061. The reversal of 1010043023 is 3203400101.
It is not a de Polignac number, because 1010043023 - 218 = 1009780879 is a prime.
It is a super-3 number, since 3×10100430233 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010042989 and 1010043007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010033023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 249308 + ... + 253326.
It is an arithmetic number, because the mean of its divisors is an integer number (48475840).
Almost surely, 21010043023 is an apocalyptic number.
1010043023 is a deficient number, since it is larger than the sum of its proper divisors (153377137).
1010043023 is a wasteful number, since it uses less digits than its factorization.
1010043023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4139 (or 4128 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 1010043023 is about 31781.1740343242. The cubic root of 1010043023 is about 1003.3365295229.
Adding to 1010043023 its reverse (3203400101), we get a palindrome (4213443124).
The spelling of 1010043023 in words is "one billion, ten million, forty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •