Base | Representation |
---|---|
bin | 10011000010010101… |
… | …10011000010000101 |
3 | 222101021000200000202 |
4 | 21201022303002011 |
5 | 131412324430023 |
6 | 4410045220245 |
7 | 511156612205 |
oct | 114112630205 |
9 | 28337020022 |
10 | 10220155013 |
11 | 4375013802 |
12 | 1b92861685 |
13 | c6b4b0603 |
14 | 6cd4b0405 |
15 | 3ec399128 |
hex | 2612b3085 |
10220155013 has 4 divisors (see below), whose sum is σ = 10821340620. Its totient is φ = 9618969408.
The previous prime is 10220155007. The next prime is 10220155021. The reversal of 10220155013 is 31055102201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8425954849 + 1794200164 = 91793^2 + 42358^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220155013 - 28 = 10220154757 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 (10220155063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300592778 + ... + 300592811.
It is an arithmetic number, because the mean of its divisors is an integer number (2705335155).
Almost surely, 210220155013 is an apocalyptic number.
It is an amenable number.
10220155013 is a deficient number, since it is larger than the sum of its proper divisors (601185607).
10220155013 is an equidigital number, since it uses as much as digits as its factorization.
10220155013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601185606.
The product of its (nonzero) digits is 300, while the sum is 20.
Adding to 10220155013 its reverse (31055102201), we get a palindrome (41275257214).
The spelling of 10220155013 in words is "ten billion, two hundred twenty million, one hundred fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •