Base | Representation |
---|---|
bin | 1001010001111001001101… |
… | …1101100100101001100011 |
3 | 1100010101210002200110100112 |
4 | 2110132103131210221203 |
5 | 2314131241430043133 |
6 | 33411111524441535 |
7 | 2102100244235522 |
oct | 224362335445143 |
9 | 40111702613315 |
10 | 10203021331043 |
11 | 3284093604a22 |
12 | 11894b72492ab |
13 | 5901aa3ba138 |
14 | 273b865aa4b9 |
15 | 12a60d771648 |
hex | 94793764a63 |
10203021331043 has 4 divisors (see below), whose sum is σ = 10203611357088. Its totient is φ = 10202431305000.
The previous prime is 10203021331037. The next prime is 10203021331051. The reversal of 10203021331043 is 34013312030201.
10203021331043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10203021331043 - 26 = 10203021330979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10203021331003) 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, 294987083 + ... + 295021668.
It is an arithmetic number, because the mean of its divisors is an integer number (2550902839272).
Almost surely, 210203021331043 is an apocalyptic number.
10203021331043 is a deficient number, since it is larger than the sum of its proper divisors (590026045).
10203021331043 is an equidigital number, since it uses as much as digits as its factorization.
10203021331043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 590026044.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10203021331043 its reverse (34013312030201), we get a palindrome (44216333361244).
The spelling of 10203021331043 in words is "ten trillion, two hundred three billion, twenty-one million, three hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •