Base | Representation |
---|---|
bin | 11101111110111001101… |
… | …00110011011010000001 |
3 | 10122111010112211200000201 |
4 | 32333130310303122001 |
5 | 113334323203411223 |
6 | 2105133540245201 |
7 | 134300236425664 |
oct | 16773464633201 |
9 | 3574115750021 |
10 | 1030202013313 |
11 | 3679a71a7580 |
12 | 1477b06a0801 |
13 | 761bc471435 |
14 | 37c0d6396db |
15 | 1bbe7e95ead |
hex | efdcd33681 |
1030202013313 has 8 divisors (see below), whose sum is σ = 1125242518176. Its totient is φ = 935392471200.
The previous prime is 1030202013301. The next prime is 1030202013319. The reversal of 1030202013313 is 3133102020301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1030202013313 - 237 = 892763059841 is a prime.
It is a super-2 number, since 2×10302020133132 (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 (1030202013319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57731356 + ... + 57749197.
It is an arithmetic number, because the mean of its divisors is an integer number (140655314772).
Almost surely, 21030202013313 is an apocalyptic number.
It is an amenable number.
1030202013313 is a deficient number, since it is larger than the sum of its proper divisors (95040504863).
1030202013313 is a wasteful number, since it uses less digits than its factorization.
1030202013313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115481375.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1030202013313 its reverse (3133102020301), we get a palindrome (4163304033614).
The spelling of 1030202013313 in words is "one trillion, thirty billion, two hundred two million, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •