Base | Representation |
---|---|
bin | 11110000000111101110… |
… | …11010010100011100110 |
3 | 10122120222211121112111220 |
4 | 33000132323102203212 |
5 | 113344111104310042 |
6 | 2105435554041210 |
7 | 134336563642356 |
oct | 17003673224346 |
9 | 3576884545456 |
10 | 1031311010022 |
11 | 3684161a7187 |
12 | 147a5bb79206 |
13 | 763381520c7 |
14 | 37cb6a3ab66 |
15 | 1bc605078ec |
hex | f01eed28e6 |
1031311010022 has 8 divisors (see below), whose sum is σ = 2062622020056. Its totient is φ = 343770336672.
The previous prime is 1031311010021. The next prime is 1031311010033. The reversal of 1031311010022 is 2200101131301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1031311010022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1031311009983 and 1031311010010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031311010021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85942584163 + ... + 85942584174.
It is an arithmetic number, because the mean of its divisors is an integer number (257827752507).
Almost surely, 21031311010022 is an apocalyptic number.
1031311010022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031311010022 is a wasteful number, since it uses less digits than its factorization.
1031311010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171885168342.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1031311010022 its reverse (2200101131301), we get a palindrome (3231412141323).
The spelling of 1031311010022 in words is "one trillion, thirty-one billion, three hundred eleven million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •