Base | Representation |
---|---|
bin | 100111000111111111… |
… | …111001011110001000 |
3 | 11000102202110022122220 |
4 | 213013333321132020 |
5 | 1142014042401440 |
6 | 31144342414040 |
7 | 3015023101101 |
oct | 470777713610 |
9 | 130382408586 |
10 | 42010122120 |
11 | 168a868959a |
12 | 8185131320 |
13 | 3c66661c35 |
14 | 206753d3a8 |
15 | 115d1e88d0 |
hex | 9c7ff9788 |
42010122120 has 64 divisors (see below), whose sum is σ = 126055249920. Its totient is φ = 11200487424.
The previous prime is 42010122113. The next prime is 42010122163. The reversal of 42010122120 is 2122101024.
It is a super-3 number, since 3×420101221203 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 42010122120.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 628552 + ... + 692168.
It is an arithmetic number, because the mean of its divisors is an integer number (1969613280).
Almost surely, 242010122120 is an apocalyptic number.
42010122120 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42010122120 is an abundant number, since it is smaller than the sum of its proper divisors (84045127800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42010122120 is a wasteful number, since it uses less digits than its factorization.
42010122120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69134 (or 69130 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 42010122120 its reverse (2122101024), we get a palindrome (44132223144).
The spelling of 42010122120 in words is "forty-two billion, ten million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •