Base | Representation |
---|---|
bin | 11101011001101110010… |
… | …11100110010100110011 |
3 | 10120120121120121220212022 |
4 | 32230313023212110303 |
5 | 113022434213231003 |
6 | 2052033235422055 |
7 | 132662523453122 |
oct | 16546713462463 |
9 | 3516546556768 |
10 | 1010243102003 |
11 | 35a494992053 |
12 | 14396045492b |
13 | 7435b451a45 |
14 | 36c789abab9 |
15 | 1b42ab44738 |
hex | eb372e6533 |
1010243102003 has 4 divisors (see below), whose sum is σ = 1017023257200. Its totient is φ = 1003462946808.
The previous prime is 1010243101979. The next prime is 1010243102009. The reversal of 1010243102003 is 3002013420101.
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 1010243102003 - 220 = 1010242053427 is a prime.
It is a super-2 number, since 2×10102431020032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010243102009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3390077375 + ... + 3390077672.
It is an arithmetic number, because the mean of its divisors is an integer number (254255814300).
Almost surely, 21010243102003 is an apocalyptic number.
1010243102003 is a deficient number, since it is larger than the sum of its proper divisors (6780155197).
1010243102003 is an equidigital number, since it uses as much as digits as its factorization.
1010243102003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6780155196.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1010243102003 its reverse (3002013420101), we get a palindrome (4012256522104).
The spelling of 1010243102003 in words is "one trillion, ten billion, two hundred forty-three million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •