Base | Representation |
---|---|
bin | 1100001111111011100… |
… | …01100101111110011001 |
3 | 1111020100010010222120111 |
4 | 12013331301211332121 |
5 | 23343420040321321 |
6 | 521202245124321 |
7 | 42256352263162 |
oct | 6077561457631 |
9 | 1436303128514 |
10 | 420869463961 |
11 | 152542927581 |
12 | 696983b96a1 |
13 | 308c31aa69b |
14 | 16527b36769 |
15 | ae33b5d5e1 |
hex | 61fdc65f99 |
420869463961 has 4 divisors (see below), whose sum is σ = 443020488400. Its totient is φ = 398718439524.
The previous prime is 420869463953. The next prime is 420869463983. The reversal of 420869463961 is 169364968024.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 420869463961 - 23 = 420869463953 is a prime.
It is a super-2 number, since 2×4208694639612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 420869463896 and 420869463905.
It is not an unprimeable number, because it can be changed into a prime (420869403961) 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, 11075512191 + ... + 11075512228.
It is an arithmetic number, because the mean of its divisors is an integer number (110755122100).
Almost surely, 2420869463961 is an apocalyptic number.
It is an amenable number.
420869463961 is a deficient number, since it is larger than the sum of its proper divisors (22151024439).
420869463961 is a wasteful number, since it uses less digits than its factorization.
420869463961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22151024438.
The product of its (nonzero) digits is 13436928, while the sum is 58.
The spelling of 420869463961 in words is "four hundred twenty billion, eight hundred sixty-nine million, four hundred sixty-three thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •