Base | Representation |
---|---|
bin | 100111000111100001… |
… | …110101100111010010 |
3 | 11000102012121222011200 |
4 | 213013201311213102 |
5 | 1142010033221002 |
6 | 31143501452030 |
7 | 3014566111020 |
oct | 470741654722 |
9 | 130365558150 |
10 | 42002242002 |
11 | 168a41970a6 |
12 | 8182571016 |
13 | 3c64b33246 |
14 | 206648b710 |
15 | 115c68db1c |
hex | 9c78759d2 |
42002242002 has 48 divisors (see below), whose sum is σ = 104158042560. Its totient is φ = 11983045536.
The previous prime is 42002242001. The next prime is 42002242019. The reversal of 42002242002 is 20024220024.
42002242002 is a `hidden beast` number, since 420 + 0 + 2 + 242 + 0 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (42002242001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 157977 + ... + 330092.
It is an arithmetic number, because the mean of its divisors is an integer number (2169959220).
Almost surely, 242002242002 is an apocalyptic number.
42002242002 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
42002242002 is an abundant number, since it is smaller than the sum of its proper divisors (62155800558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42002242002 is a wasteful number, since it uses less digits than its factorization.
42002242002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488767 (or 488764 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 18.
Adding to 42002242002 its reverse (20024220024), we get a palindrome (62026462026).
The spelling of 42002242002 in words is "forty-two billion, two million, two hundred forty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •