Base | Representation |
---|---|
bin | 1100001110101111100… |
… | …11011101101111101011 |
3 | 1111011200201102210222222 |
4 | 12013113303131233223 |
5 | 23341113444422311 |
6 | 521015131104255 |
7 | 42234515431133 |
oct | 6072763355753 |
9 | 1434621383888 |
10 | 420232420331 |
11 | 152246278239 |
12 | 6953aba208b |
13 | 30821211aa9 |
14 | 164a72a9ac3 |
15 | ade7c74adb |
hex | 61d7cddbeb |
420232420331 has 8 divisors (see below), whose sum is σ = 445691976864. Its totient is φ = 395371912320.
The previous prime is 420232420327. The next prime is 420232420373. The reversal of 420232420331 is 133024232024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 420232420331 - 22 = 420232420327 is a prime.
It is a super-2 number, since 2×4202324203312 (a number of 24 digits) contains 22 as substring.
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 420232420331.
It is not an unprimeable number, because it can be changed into a prime (420232420381) 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, 149760686 + ... + 149763491.
It is an arithmetic number, because the mean of its divisors is an integer number (55711497108).
Almost surely, 2420232420331 is an apocalyptic number.
420232420331 is a deficient number, since it is larger than the sum of its proper divisors (25459556533).
420232420331 is a wasteful number, since it uses less digits than its factorization.
420232420331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 299524261.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 420232420331 its reverse (133024232024), we get a palindrome (553256652355).
The spelling of 420232420331 in words is "four hundred twenty billion, two hundred thirty-two million, four hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •