Base | Representation |
---|---|
bin | 11101101111110110101… |
… | …01110100101100110100 |
3 | 10121201021120201200021200 |
4 | 32313323111310230310 |
5 | 113221302224120002 |
6 | 2101320213412500 |
7 | 133563121041123 |
oct | 16677325645464 |
9 | 3551246650250 |
10 | 1022124051252 |
11 | 364531420077 |
12 | 14611733a130 |
13 | 75502a32725 |
14 | 37684879aba |
15 | 1b8c3beab1c |
hex | edfb574b34 |
1022124051252 has 72 divisors (see below), whose sum is σ = 2621293688832. Its totient is φ = 335786472000.
The previous prime is 1022124051251. The next prime is 1022124051271. The reversal of 1022124051252 is 2521504212201.
1022124051252 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 1 + 2 + 405 + 1 + 252 = 666.
It is a super-2 number, since 2×10221240512522 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022124051251) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 49899 + ... + 1430642.
Almost surely, 21022124051252 is an apocalyptic number.
1022124051252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1022124051252 is an abundant number, since it is smaller than the sum of its proper divisors (1599169637580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022124051252 is a wasteful number, since it uses less digits than its factorization.
1022124051252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1480829 (or 1480824 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 1022124051252 its reverse (2521504212201), we get a palindrome (3543628263453).
The spelling of 1022124051252 in words is "one trillion, twenty-two billion, one hundred twenty-four million, fifty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •