Base | Representation |
---|---|
bin | 101111110000101111000000… |
… | …1111010100001100111010100 |
3 | 2001002111112201021011101002110 |
4 | 1133201132001322201213110 |
5 | 420031123300322124030 |
6 | 4045301521003311020 |
7 | 154330156420021641 |
oct | 13741360172414724 |
9 | 2032445637141073 |
10 | 420114405661140 |
11 | 1119525786aa203 |
12 | 3b150ba051b470 |
13 | 150558069c4368 |
14 | 75a5907c38dc8 |
15 | 3388216c631b0 |
hex | 17e1781ea19d4 |
420114405661140 has 24 divisors (see below), whose sum is σ = 1176320335851360. Its totient is φ = 112030508176288.
The previous prime is 420114405661103. The next prime is 420114405661169. The reversal of 420114405661140 is 41166504411024.
It is a super-2 number, since 2×4201144056611402 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3500953380450 + ... + 3500953380569.
It is an arithmetic number, because the mean of its divisors is an integer number (49013347327140).
Almost surely, 2420114405661140 is an apocalyptic number.
It is an amenable number.
420114405661140 is an abundant number, since it is smaller than the sum of its proper divisors (756205930190220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
420114405661140 is a wasteful number, since it uses less digits than its factorization.
420114405661140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7001906761031 (or 7001906761029 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 39.
It can be divided in two parts, 420114405 and 661140, that added together give a triangular number (420775545 = T29009).
The spelling of 420114405661140 in words is "four hundred twenty trillion, one hundred fourteen billion, four hundred five million, six hundred sixty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •