Base | Representation |
---|---|
bin | 1100001111010011000… |
… | …11000010000100000011 |
3 | 1111012110110120122012122 |
4 | 12013221203002010003 |
5 | 23342221201240111 |
6 | 521104443314455 |
7 | 42245061615230 |
oct | 6075143020403 |
9 | 1435413518178 |
10 | 420530102531 |
11 | 152389309290 |
12 | 6960281ba2b |
13 | 3086aaaa8c6 |
14 | 164d4a38787 |
15 | ae13e76cdb |
hex | 61e98c2103 |
420530102531 has 8 divisors (see below), whose sum is σ = 524297270784. Its totient is φ = 327685794120.
The previous prime is 420530102521. The next prime is 420530102593. The reversal of 420530102531 is 135201035024.
It is a happy number.
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-420530102531 is a prime.
It is a super-2 number, since 2×4205301025312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 420530102531.
It is not an unprimeable number, because it can be changed into a prime (420530102521) 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, 2730714875 + ... + 2730715028.
It is an arithmetic number, because the mean of its divisors is an integer number (65537158848).
Almost surely, 2420530102531 is an apocalyptic number.
420530102531 is a deficient number, since it is larger than the sum of its proper divisors (103767168253).
420530102531 is a wasteful number, since it uses less digits than its factorization.
420530102531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5461429921.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 420530102531 its reverse (135201035024), we get a palindrome (555731137555).
The spelling of 420530102531 in words is "four hundred twenty billion, five hundred thirty million, one hundred two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •