Base | Representation |
---|---|
bin | 1001010111100100100010… |
… | …1010000001110111000111 |
3 | 1100110201112002010021100111 |
4 | 2111321020222001313013 |
5 | 2322231011420144111 |
6 | 33524001350253451 |
7 | 2112122150033554 |
oct | 225711052016707 |
9 | 40421462107314 |
10 | 10300550553031 |
11 | 3311491285a22 |
12 | 11a4395657287 |
13 | 59945105c24b |
14 | 278799425a2b |
15 | 12ce1ab03a21 |
hex | 95e48a81dc7 |
10300550553031 has 4 divisors (see below), whose sum is σ = 10454290113592. Its totient is φ = 10146810992472.
The previous prime is 10300550552969. The next prime is 10300550553043. The reversal of 10300550553031 is 13035505500301.
It is a happy number.
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 10300550553031 - 213 = 10300550544839 is a prime.
It is a super-2 number, since 2×103005505530312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10300550552984 and 10300550553002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10300550553091) 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, 76869780180 + ... + 76869780313.
It is an arithmetic number, because the mean of its divisors is an integer number (2613572528398).
Almost surely, 210300550553031 is an apocalyptic number.
10300550553031 is a deficient number, since it is larger than the sum of its proper divisors (153739560561).
10300550553031 is an equidigital number, since it uses as much as digits as its factorization.
10300550553031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153739560560.
The product of its (nonzero) digits is 16875, while the sum is 31.
The spelling of 10300550553031 in words is "ten trillion, three hundred billion, five hundred fifty million, five hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •