Base | Representation |
---|---|
bin | 11101011001101011110… |
… | …11001011110101111100 |
3 | 10120120120002221221112220 |
4 | 32230311323023311330 |
5 | 113022413314201022 |
6 | 2052031203525340 |
7 | 132662146335330 |
oct | 16546573136574 |
9 | 3516502857486 |
10 | 1010222022012 |
11 | 35a483aa4375 |
12 | 143955389850 |
13 | 74356c80b88 |
14 | 36c75c817c0 |
15 | 1b428d7d85c |
hex | eb35ecbd7c |
1010222022012 has 48 divisors (see below), whose sum is σ = 2693986686720. Its totient is φ = 288628296192.
The previous prime is 1010222022011. The next prime is 1010222022023. The reversal of 1010222022012 is 2102202220101.
It is a junction number, because it is equal to n+sod(n) for n = 1010222021982 and 1010222022000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010222022011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4511443 + ... + 4730069.
It is an arithmetic number, because the mean of its divisors is an integer number (56124722640).
Almost surely, 21010222022012 is an apocalyptic number.
1010222022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010222022012 is an abundant number, since it is smaller than the sum of its proper divisors (1683764664708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010222022012 is a wasteful number, since it uses less digits than its factorization.
1010222022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273650 (or 273648 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1010222022012 its reverse (2102202220101), we get a palindrome (3112424242113).
The spelling of 1010222022012 in words is "one trillion, ten billion, two hundred twenty-two million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •