Base | Representation |
---|---|
bin | 111101001001011101001… |
… | …000000010000001010011 |
3 | 112212201012102100112210010 |
4 | 331021131020002001103 |
5 | 1022321234320331003 |
6 | 12534220221010003 |
7 | 612405323043033 |
oct | 75113510020123 |
9 | 15781172315703 |
10 | 4202040402003 |
11 | 1380091295014 |
12 | 57a4729b3903 |
13 | 246334a69772 |
14 | 1075463d58c3 |
15 | 74488623003 |
hex | 3d25d202053 |
4202040402003 has 8 divisors (see below), whose sum is σ = 5604273841408. Its totient is φ = 2800583615304.
The previous prime is 4202040401927. The next prime is 4202040402011. The reversal of 4202040402003 is 3002040402024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4202040402003 - 28 = 4202040401747 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4202040402023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 194150551 + ... + 194172192.
It is an arithmetic number, because the mean of its divisors is an integer number (700534230176).
Almost surely, 24202040402003 is an apocalyptic number.
4202040402003 is a deficient number, since it is larger than the sum of its proper divisors (1402233439405).
4202040402003 is a wasteful number, since it uses less digits than its factorization.
4202040402003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388326353.
The product of its (nonzero) digits is 1536, while the sum is 21.
Adding to 4202040402003 its sum of digits (21), we get a palindrome (4202040402024).
Adding to 4202040402003 its reverse (3002040402024), we get a palindrome (7204080804027).
The spelling of 4202040402003 in words is "four trillion, two hundred two billion, forty million, four hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •