Base | Representation |
---|---|
bin | 1001001101000101000100… |
… | …0101011100011011000101 |
3 | 1022211111021100011200020210 |
4 | 2103101101011130123011 |
5 | 2311302340123043023 |
6 | 33305111514550033 |
7 | 2063111356651551 |
oct | 223212105343305 |
9 | 38744240150223 |
10 | 10120303331013 |
11 | 3251aa6438227 |
12 | 1175471138319 |
13 | 5854571388a5 |
14 | 26db7a874861 |
15 | 1283bb864593 |
hex | 9345115c6c5 |
10120303331013 has 8 divisors (see below), whose sum is σ = 13858433390368. Its totient is φ = 6564521079504.
The previous prime is 10120303330961. The next prime is 10120303331129. The reversal of 10120303331013 is 31013330302101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10120303331013 - 210 = 10120303329989 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 (10120303331813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45586951831 + ... + 45586952052.
It is an arithmetic number, because the mean of its divisors is an integer number (1732304173796).
Almost surely, 210120303331013 is an apocalyptic number.
It is an amenable number.
10120303331013 is a deficient number, since it is larger than the sum of its proper divisors (3738130059355).
10120303331013 is an equidigital number, since it uses as much as digits as its factorization.
10120303331013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91173903923.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 10120303331013 its reverse (31013330302101), we get a palindrome (41133633633114).
The spelling of 10120303331013 in words is "ten trillion, one hundred twenty billion, three hundred three million, three hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •