Base | Representation |
---|---|
bin | 11101111110111010111… |
… | …11111001011000111011 |
3 | 10122111011100002121011221 |
4 | 32333131133321120323 |
5 | 113334334101410021 |
6 | 2105135022332511 |
7 | 134300434435654 |
oct | 16773537713073 |
9 | 3574140077157 |
10 | 1030213310011 |
11 | 367a02612996 |
12 | 1477b442a137 |
13 | 761c18c8282 |
14 | 37c10d3a52b |
15 | 1bbe8e78241 |
hex | efdd7f963b |
1030213310011 has 8 divisors (see below), whose sum is σ = 1039398079824. Its totient is φ = 1021029730560.
The previous prime is 1030213310003. The next prime is 1030213310039. The reversal of 1030213310011 is 1100133120301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030213310011 - 23 = 1030213310003 is a prime.
It is a super-2 number, since 2×10302133100112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030213310611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1488616 + ... + 2067946.
It is an arithmetic number, because the mean of its divisors is an integer number (129924759978).
Almost surely, 21030213310011 is an apocalyptic number.
1030213310011 is a deficient number, since it is larger than the sum of its proper divisors (9184769813).
1030213310011 is a wasteful number, since it uses less digits than its factorization.
1030213310011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595181.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1030213310011 its reverse (1100133120301), we get a palindrome (2130346430312).
The spelling of 1030213310011 in words is "one trillion, thirty billion, two hundred thirteen million, three hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •