Base | Representation |
---|---|
bin | 101011110011010010000… |
… | …110011010000001100110 |
3 | 101122202100012210121211110 |
4 | 223303102012122001212 |
5 | 343303441003031042 |
6 | 10222435325045450 |
7 | 430315440604611 |
oct | 53632206320146 |
9 | 11582305717743 |
10 | 3010002002022 |
11 | a60597728954 |
12 | 4074376b6886 |
13 | 18aac3a6b6b2 |
14 | a598341b178 |
15 | 5346c89a09c |
hex | 2bcd219a066 |
3010002002022 has 16 divisors (see below), whose sum is σ = 6023681484912. Its totient is φ = 1002721087200.
The previous prime is 3010002002011. The next prime is 3010002002027. The reversal of 3010002002022 is 2202002000103.
It is a super-2 number, since 2×30100020020222 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3010002001989 and 3010002002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3010002002027) 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 7 ways as a sum of consecutive naturals, for example, 153217729 + ... + 153237372.
It is an arithmetic number, because the mean of its divisors is an integer number (376480092807).
Almost surely, 23010002002022 is an apocalyptic number.
3010002002022 is an abundant number, since it is smaller than the sum of its proper divisors (3013679482890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3010002002022 is a wasteful number, since it uses less digits than its factorization.
3010002002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306456743.
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 3010002002022 its reverse (2202002000103), we get a palindrome (5212004002125).
The spelling of 3010002002022 in words is "three trillion, ten billion, two million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •