Base | Representation |
---|---|
bin | 1001001100000100101011… |
… | …1111100000101101001101 |
3 | 1022202211122220212122121212 |
4 | 2103001022333200231031 |
5 | 2311011441414240323 |
6 | 33253132555504205 |
7 | 2061630166433123 |
oct | 223011277405515 |
9 | 38684586778555 |
10 | 10103021243213 |
11 | 3245738119938 |
12 | 1172049458065 |
13 | 583931879732 |
14 | 26cdbb525913 |
15 | 127c0951ab78 |
hex | 9304afe0b4d |
10103021243213 has 4 divisors (see below), whose sum is σ = 10253812605120. Its totient is φ = 9952229881308.
The previous prime is 10103021243171. The next prime is 10103021243219. The reversal of 10103021243213 is 31234212030101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10103021243213 - 26 = 10103021243149 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 (10103021243219) 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, 75395680853 + ... + 75395680986.
It is an arithmetic number, because the mean of its divisors is an integer number (2563453151280).
Almost surely, 210103021243213 is an apocalyptic number.
It is an amenable number.
10103021243213 is a deficient number, since it is larger than the sum of its proper divisors (150791361907).
10103021243213 is an equidigital number, since it uses as much as digits as its factorization.
10103021243213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150791361906.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10103021243213 its reverse (31234212030101), we get a palindrome (41337233273314).
The spelling of 10103021243213 in words is "ten trillion, one hundred three billion, twenty-one million, two hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •