Base | Representation |
---|---|
bin | 11101101100001000000… |
… | …00100110101010111010 |
3 | 10121112010001111221100110 |
4 | 32312010000212222322 |
5 | 113203202213000213 |
6 | 2100345414445150 |
7 | 133462400634150 |
oct | 16660400465272 |
9 | 3545101457313 |
10 | 1020122000058 |
11 | 3636a4302407 |
12 | 1458589637b6 |
13 | 7527401a855 |
14 | 37534a093d0 |
15 | 1b8080805c3 |
hex | ed84026aba |
1020122000058 has 64 divisors (see below), whose sum is σ = 2598807075840. Its totient is φ = 259880700672.
The previous prime is 1020122000057. The next prime is 1020122000063. The reversal of 1020122000058 is 8500002210201.
It is a happy number.
It is a super-3 number, since 3×10201220000583 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1020121999998 and 1020122000043.
It is not an unprimeable number, because it can be changed into a prime (1020122000057) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37584916 + ... + 37612047.
It is an arithmetic number, because the mean of its divisors is an integer number (40606360560).
Almost surely, 21020122000058 is an apocalyptic number.
1020122000058 is an abundant number, since it is smaller than the sum of its proper divisors (1578685075782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020122000058 is a wasteful number, since it uses less digits than its factorization.
1020122000058 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75197011.
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 1020122000058 its reverse (8500002210201), we get a palindrome (9520124210259).
The spelling of 1020122000058 in words is "one trillion, twenty billion, one hundred twenty-two million, fifty-eight", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •