Base | Representation |
---|---|
bin | 1001010010010111000011… |
… | …0101000011111001110011 |
3 | 1100011011110020211012011101 |
4 | 2110211300311003321303 |
5 | 2314244142214023103 |
6 | 33414514343025231 |
7 | 2102502563541265 |
oct | 224456065037163 |
9 | 40134406735141 |
10 | 10211030220403 |
11 | 32875233a4051 |
12 | 118ab7143b217 |
13 | 590b8572341c |
14 | 274306109b35 |
15 | 12a92b925a1d |
hex | 94970d43e73 |
10211030220403 has 4 divisors (see below), whose sum is σ = 10216384721640. Its totient is φ = 10205675719168.
The previous prime is 10211030220373. The next prime is 10211030220409. The reversal of 10211030220403 is 30402203011201.
It is a happy number.
10211030220403 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 10211030220403 - 25 = 10211030220371 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211030220409) 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, 2677247758 + ... + 2677251571.
It is an arithmetic number, because the mean of its divisors is an integer number (2554096180410).
Almost surely, 210211030220403 is an apocalyptic number.
10211030220403 is a deficient number, since it is larger than the sum of its proper divisors (5354501237).
10211030220403 is an equidigital number, since it uses as much as digits as its factorization.
10211030220403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5354501236.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10211030220403 its reverse (30402203011201), we get a palindrome (40613233231604).
The spelling of 10211030220403 in words is "ten trillion, two hundred eleven billion, thirty million, two hundred twenty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •