Base | Representation |
---|---|
bin | 1001010001111001100001… |
… | …0101001100010110010010 |
3 | 1100010101222210101201010112 |
4 | 2110132120111030112102 |
5 | 2314131423333123214 |
6 | 33411124003401322 |
7 | 2102102255466152 |
oct | 224363025142622 |
9 | 40111883351115 |
10 | 10203103020434 |
11 | 328412572a415 |
12 | 118951a683242 |
13 | 5901c12bc45c |
14 | 273b93392762 |
15 | 12a615a0aa3e |
hex | 9479854c592 |
10203103020434 has 8 divisors (see below), whose sum is σ = 15304899463500. Its totient is φ = 5101469865936.
The previous prime is 10203103020373. The next prime is 10203103020437. The reversal of 10203103020434 is 43402030130201.
It can be written as a sum of positive squares in 2 ways, for example, as 10203073350625 + 29669809 = 3194225^2 + 5447^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×102031030204343 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10203103020437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40665809 + ... + 40915940.
Almost surely, 210203103020434 is an apocalyptic number.
10203103020434 is a deficient number, since it is larger than the sum of its proper divisors (5101796443066).
10203103020434 is an equidigital number, since it uses as much as digits as its factorization.
10203103020434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81644284.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 10203103020434 its reverse (43402030130201), we get a palindrome (53605133150635).
The spelling of 10203103020434 in words is "ten trillion, two hundred three billion, one hundred three million, twenty thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •