Base | Representation |
---|---|
bin | 1001000111011100011101… |
… | …0110000100001111100111 |
3 | 1022111020102011120002100022 |
4 | 2101313013112010033213 |
5 | 2303211113301331403 |
6 | 33152422255105355 |
7 | 2053113516006530 |
oct | 221670726041747 |
9 | 38436364502308 |
10 | 10023503152103 |
11 | 3214a42243071 |
12 | 115a756b1225b |
13 | 57929b53440c |
14 | 2691d6793687 |
15 | 125b034ded38 |
hex | 91dc75843e7 |
10023503152103 has 4 divisors (see below), whose sum is σ = 11455432173840. Its totient is φ = 8591574130368.
The previous prime is 10023503152057. The next prime is 10023503152121. The reversal of 10023503152103 is 30125130532001.
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 10023503152103 - 238 = 9748625245159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023503152133) 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, 715964510858 + ... + 715964510871.
It is an arithmetic number, because the mean of its divisors is an integer number (2863858043460).
Almost surely, 210023503152103 is an apocalyptic number.
10023503152103 is a deficient number, since it is larger than the sum of its proper divisors (1431929021737).
10023503152103 is an equidigital number, since it uses as much as digits as its factorization.
10023503152103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1431929021736.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 10023503152103 its reverse (30125130532001), we get a palindrome (40148633684104).
The spelling of 10023503152103 in words is "ten trillion, twenty-three billion, five hundred three million, one hundred fifty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •