Base | Representation |
---|---|
bin | 111100100000101… |
… | …1010010101000010 |
3 | 12020111120200012000 |
4 | 1321001122111002 |
5 | 13124241204442 |
6 | 533250444430 |
7 | 101213140533 |
oct | 17101322502 |
9 | 5214520160 |
10 | 2030413122 |
11 | 95212a481 |
12 | 487b93716 |
13 | 2648653aa |
14 | 15393468a |
15 | bd3bdd4c |
hex | 7905a542 |
2030413122 has 32 divisors (see below), whose sum is σ = 4777444800. Its totient is φ = 636992064.
The previous prime is 2030413117. The next prime is 2030413123. The reversal of 2030413122 is 2213140302.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2030413095 and 2030413104.
It is not an unprimeable number, because it can be changed into a prime (2030413123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1104972 + ... + 1106807.
It is an arithmetic number, because the mean of its divisors is an integer number (149295150).
Almost surely, 22030413122 is an apocalyptic number.
2030413122 is an abundant number, since it is smaller than the sum of its proper divisors (2747031678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2030413122 is a wasteful number, since it uses less digits than its factorization.
2030413122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2211807 (or 2211801 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 2030413122 is about 45060.1056589973. The cubic root of 2030413122 is about 1266.2753045626.
Adding to 2030413122 its reverse (2213140302), we get a palindrome (4243553424).
The spelling of 2030413122 in words is "two billion, thirty million, four hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •