Base | Representation |
---|---|
bin | 1001010010010011111111… |
… | …1100101000100100100110 |
3 | 1100011002100002122212200021 |
4 | 2110210333330220210212 |
5 | 2314241002242401042 |
6 | 33414301125305354 |
7 | 2102443345036021 |
oct | 224447774504446 |
9 | 40132302585607 |
10 | 10210210122022 |
11 | 3287142485a99 |
12 | 118a98286525a |
13 | 590a84854401 |
14 | 27426922c1b8 |
15 | 12a8ce92d867 |
hex | 9493ff28926 |
10210210122022 has 4 divisors (see below), whose sum is σ = 15315315183036. Its totient is φ = 5105105061010.
The previous prime is 10210210121963. The next prime is 10210210122029. The reversal of 10210210122022 is 22022101201201.
It is a happy number.
10210210122022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 10210210121987 and 10210210122005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210210122029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552552530504 + ... + 2552552530507.
It is an arithmetic number, because the mean of its divisors is an integer number (3828828795759).
Almost surely, 210210210122022 is an apocalyptic number.
10210210122022 is a deficient number, since it is larger than the sum of its proper divisors (5105105061014).
10210210122022 is an equidigital number, since it uses as much as digits as its factorization.
10210210122022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5105105061013.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10210210122022 its reverse (22022101201201), we get a palindrome (32232311323223).
The spelling of 10210210122022 in words is "ten trillion, two hundred ten billion, two hundred ten million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •