Base | Representation |
---|---|
bin | 101100110100101… |
… | …0101111100100110 |
3 | 10212211001121212220 |
4 | 1121221111330212 |
5 | 11040011310042 |
6 | 405124053210 |
7 | 52161605604 |
oct | 13151257446 |
9 | 3784047786 |
10 | 1504010022 |
11 | 701a79a99 |
12 | 35b834206 |
13 | 1ac797578 |
14 | 103a68874 |
15 | 8c08c8ec |
hex | 59a55f26 |
1504010022 has 16 divisors (see below), whose sum is σ = 3057332592. Its totient is φ = 493117920.
The previous prime is 1504009993. The next prime is 1504010029. The reversal of 1504010022 is 2200104051.
It is a super-2 number, since 2×15040100222 = 4524092292552880968, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1504009983 and 1504010010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1504010029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2054293 + ... + 2055024.
It is an arithmetic number, because the mean of its divisors is an integer number (191083287).
Almost surely, 21504010022 is an apocalyptic number.
1504010022 is an abundant number, since it is smaller than the sum of its proper divisors (1553322570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1504010022 is a wasteful number, since it uses less digits than its factorization.
1504010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4109383.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 1504010022 is about 38781.5680704120. The cubic root of 1504010022 is about 1145.7334080744.
Adding to 1504010022 its reverse (2200104051), we get a palindrome (3704114073).
The spelling of 1504010022 in words is "one billion, five hundred four million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •