Base | Representation |
---|---|
bin | 11101111111000101010… |
… | …11011011111110000001 |
3 | 10122111101101122011002001 |
4 | 32333202223123332001 |
5 | 113340023324040223 |
6 | 2105151405224001 |
7 | 134302541245456 |
oct | 16774253337601 |
9 | 3574341564061 |
10 | 1030300221313 |
11 | 367a47684710 |
12 | 147819562001 |
13 | 7620690838c |
14 | 37c1c6c182d |
15 | 1bc018e49ad |
hex | efe2adbf81 |
1030300221313 has 4 divisors (see below), whose sum is σ = 1123963877808. Its totient is φ = 936636564820.
The previous prime is 1030300221271. The next prime is 1030300221337. The reversal of 1030300221313 is 3131220030301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-1030300221313 is a prime.
It is a super-3 number, since 3×10303002213133 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030300321313) 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, 46831828231 + ... + 46831828252.
It is an arithmetic number, because the mean of its divisors is an integer number (280990969452).
Almost surely, 21030300221313 is an apocalyptic number.
It is an amenable number.
1030300221313 is a deficient number, since it is larger than the sum of its proper divisors (93663656495).
1030300221313 is an equidigital number, since it uses as much as digits as its factorization.
1030300221313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93663656494.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1030300221313 its reverse (3131220030301), we get a palindrome (4161520251614).
The spelling of 1030300221313 in words is "one trillion, thirty billion, three hundred million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •