Base | Representation |
---|---|
bin | 1100001110010100100… |
… | …11111100111001100011 |
3 | 1111011002221111021212012 |
4 | 12013022103330321203 |
5 | 23340133022234043 |
6 | 520540443223135 |
7 | 42226066365335 |
oct | 6071223747143 |
9 | 1434087437765 |
10 | 420006055523 |
11 | 15213a517a8a |
12 | 69497217aab |
13 | 307b6356312 |
14 | 164851c3455 |
15 | add2e5da18 |
hex | 61ca4fce63 |
420006055523 has 4 divisors (see below), whose sum is σ = 421150486560. Its totient is φ = 418861624488.
The previous prime is 420006055517. The next prime is 420006055529. The reversal of 420006055523 is 325550600024.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (420006055517) and next prime (420006055529).
It is a cyclic number.
It is not a de Polignac number, because 420006055523 - 26 = 420006055459 is a prime.
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 420006055523.
It is not an unprimeable number, because it can be changed into a prime (420006055529) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 572214968 + ... + 572215701.
It is an arithmetic number, because the mean of its divisors is an integer number (105287621640).
Almost surely, 2420006055523 is an apocalyptic number.
420006055523 is a deficient number, since it is larger than the sum of its proper divisors (1144431037).
420006055523 is a wasteful number, since it uses less digits than its factorization.
420006055523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1144431036.
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 420006055523 its reverse (325550600024), we get a palindrome (745556655547).
The spelling of 420006055523 in words is "four hundred twenty billion, six million, fifty-five thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •