Base | Representation |
---|---|
bin | 101111110001110101110011… |
… | …010111001010110000111010 |
3 | 1000120000112112201202021200020 |
4 | 233301311303113022300322 |
5 | 210020310303331110132 |
6 | 2022525510355551310 |
7 | 62155423562534403 |
oct | 5761656327126072 |
9 | 1016015481667606 |
10 | 210133210410042 |
11 | 60a55aa312a037 |
12 | 1b699282bbb536 |
13 | 9033627463b2a |
14 | 39c67047569aa |
15 | 19460a8aed52c |
hex | bf1d735cac3a |
210133210410042 has 32 divisors (see below), whose sum is σ = 426272469013440. Its totient is φ = 69048150821760.
The previous prime is 210133210409959. The next prime is 210133210410047. The reversal of 210133210410042 is 240014012331012.
It is a super-2 number, since 2×2101332104100422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210133210409994 and 210133210410021.
It is not an unprimeable number, because it can be changed into a prime (210133210410047) 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, 594246033 + ... + 594599540.
It is an arithmetic number, because the mean of its divisors is an integer number (13321014656670).
Almost surely, 2210133210410042 is an apocalyptic number.
210133210410042 is an abundant number, since it is smaller than the sum of its proper divisors (216139258603398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210133210410042 is a wasteful number, since it uses less digits than its factorization.
210133210410042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1188845998.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 210133210410042 its reverse (240014012331012), we get a palindrome (450147222741054).
The spelling of 210133210410042 in words is "two hundred ten trillion, one hundred thirty-three billion, two hundred ten million, four hundred ten thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •