Base | Representation |
---|---|
bin | 11101111110100010000… |
… | …11100010101001000101 |
3 | 10122110121210021111120120 |
4 | 32333101003202221011 |
5 | 113333422131101323 |
6 | 2105102204052153 |
7 | 134262321135552 |
oct | 16772103425105 |
9 | 3573553244516 |
10 | 1030004550213 |
11 | 367905797631 |
12 | 147756534059 |
13 | 7618a594a72 |
14 | 37bd1317a29 |
15 | 1bbd598d5e3 |
hex | efd10e2a45 |
1030004550213 has 32 divisors (see below), whose sum is σ = 1473975174144. Its totient is φ = 638215345152.
The previous prime is 1030004550173. The next prime is 1030004550221. The reversal of 1030004550213 is 3120554000301.
1030004550213 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1030004550213 - 212 = 1030004546117 is a prime.
It is a super-4 number, since 4×10300045502134 (a number of 49 digits) contains 4444 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030004950213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 326731 + ... + 1471992.
It is an arithmetic number, because the mean of its divisors is an integer number (46061724192).
Almost surely, 21030004550213 is an apocalyptic number.
It is an amenable number.
1030004550213 is a deficient number, since it is larger than the sum of its proper divisors (443970623931).
1030004550213 is a wasteful number, since it uses less digits than its factorization.
1030004550213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1798985.
The product of its (nonzero) digits is 1800, while the sum is 24.
Adding to 1030004550213 its reverse (3120554000301), we get a palindrome (4150558550514).
The spelling of 1030004550213 in words is "one trillion, thirty billion, four million, five hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •