Base | Representation |
---|---|
bin | 11101000110101001100… |
… | …00111011110010111111 |
3 | 10112121011212012120002201 |
4 | 32203110300323302333 |
5 | 112341001003312203 |
6 | 2043221121332331 |
7 | 132150660560662 |
oct | 16432460736277 |
9 | 3477155176081 |
10 | 1000002010303 |
11 | 35610a0792aa |
12 | 1419827970a7 |
13 | 733b882087a |
14 | 3658680b6d9 |
15 | 1b02ba11e1d |
hex | e8d4c3bcbf |
1000002010303 has 8 divisors (see below), whose sum is σ = 1011073332096. Its totient is φ = 988953636000.
The previous prime is 1000002010291. The next prime is 1000002010349. The reversal of 1000002010303 is 3030102000001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000002010303 is a prime.
It is a super-2 number, since 2×10000020103032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1000002010303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000002010363) 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, 5649228 + ... + 5823553.
It is an arithmetic number, because the mean of its divisors is an integer number (126384166512).
Almost surely, 21000002010303 is an apocalyptic number.
1000002010303 is a deficient number, since it is larger than the sum of its proper divisors (11071321793).
1000002010303 is a wasteful number, since it uses less digits than its factorization.
1000002010303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11473745.
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 1000002010303 its reverse (3030102000001), we get a palindrome (4030104010304).
The spelling of 1000002010303 in words is "one trillion, two million, ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •