Base | Representation |
---|---|
bin | 10111010000101101010011… |
… | …101011110010001101011011 |
3 | 111102020002111222220221000102 |
4 | 113100231103223302031123 |
5 | 101402114003340311303 |
6 | 1001325242143130015 |
7 | 30356110260203225 |
oct | 2720552353621533 |
9 | 442202458827012 |
10 | 102303230010203 |
11 | 2a662613334782 |
12 | b5830748a390b |
13 | 45111cb754251 |
14 | 1b397077a1415 |
15 | bc621d7d6288 |
hex | 5d0b53af235b |
102303230010203 has 4 divisors (see below), whose sum is σ = 102318223895088. Its totient is φ = 102288236125320.
The previous prime is 102303230010197. The next prime is 102303230010277. The reversal of 102303230010203 is 302010032303201.
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 102303230010203 - 218 = 102303229748059 is a prime.
It is a super-2 number, since 2×1023032300102032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102303230010503) 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, 7496932208 + ... + 7496945853.
It is an arithmetic number, because the mean of its divisors is an integer number (25579555973772).
Almost surely, 2102303230010203 is an apocalyptic number.
102303230010203 is a deficient number, since it is larger than the sum of its proper divisors (14993884885).
102303230010203 is an equidigital number, since it uses as much as digits as its factorization.
102303230010203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14993884884.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 102303230010203 its reverse (302010032303201), we get a palindrome (404313262313404).
The spelling of 102303230010203 in words is "one hundred two trillion, three hundred three billion, two hundred thirty million, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •