Base | Representation |
---|---|
bin | 11101111110111001101… |
… | …01100001101110001011 |
3 | 10122111010120012022020212 |
4 | 32333130311201232023 |
5 | 113334323230444034 |
6 | 2105133544311335 |
7 | 134300241146033 |
oct | 16773465415613 |
9 | 3574116168225 |
10 | 1030202203019 |
11 | 3679a7317060 |
12 | 1477b077254b |
13 | 761bc5098a2 |
14 | 37c0d6888c3 |
15 | 1bbe7ed22ce |
hex | efdcd61b8b |
1030202203019 has 8 divisors (see below), whose sum is σ = 1123871656512. Its totient is φ = 936535200840.
The previous prime is 1030202203007. The next prime is 1030202203031. The reversal of 1030202203019 is 9103022020301.
It is an interprime number because it is at equal distance from previous prime (1030202203007) and next prime (1030202203031).
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 1030202203019 - 28 = 1030202202763 is a prime.
It is a super-2 number, since 2×10302022030192 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030202202985 and 1030202203003.
It is not an unprimeable number, because it can be changed into a prime (1030202208019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 328832 + ... + 1472594.
It is an arithmetic number, because the mean of its divisors is an integer number (140483957064).
Almost surely, 21030202203019 is an apocalyptic number.
1030202203019 is a deficient number, since it is larger than the sum of its proper divisors (93669453493).
1030202203019 is a wasteful number, since it uses less digits than its factorization.
1030202203019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1225657.
The product of its (nonzero) digits is 648, while the sum is 23.
The spelling of 1030202203019 in words is "one trillion, thirty billion, two hundred two million, two hundred three thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •