Base | Representation |
---|---|
bin | 10011000110011100101111… |
… | …10100011110001000101010 |
3 | 12111201110011112120202210120 |
4 | 21203032113310132020222 |
5 | 21001134202232131442 |
6 | 225155532054024110 |
7 | 11563422203511543 |
oct | 1143162764361052 |
9 | 174643145522716 |
10 | 42003032302122 |
11 | 12424427799371 |
12 | 4864576648036 |
13 | 1a58b3b113138 |
14 | a52d5997d4ca |
15 | 4cc8de01e4ec |
hex | 263397d1e22a |
42003032302122 has 32 divisors (see below), whose sum is σ = 88535143609920. Its totient is φ = 13247959386240.
The previous prime is 42003032302087. The next prime is 42003032302159. The reversal of 42003032302122 is 22120323030024.
42003032302122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 42003032302092 and 42003032302101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224295963 + ... + 224483150.
It is an arithmetic number, because the mean of its divisors is an integer number (2766723237810).
Almost surely, 242003032302122 is an apocalyptic number.
42003032302122 is an abundant number, since it is smaller than the sum of its proper divisors (46532111307798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42003032302122 is a wasteful number, since it uses less digits than its factorization.
42003032302122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448779958.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 42003032302122 its reverse (22120323030024), we get a palindrome (64123355332146).
The spelling of 42003032302122 in words is "forty-two trillion, three billion, thirty-two million, three hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •