Base | Representation |
---|---|
bin | 101111110000001101010011… |
… | …110000110001010101010010 |
3 | 1000112121210221100221211111002 |
4 | 233300031103300301111102 |
5 | 210011441012320213020 |
6 | 2022402153123222002 |
7 | 62144342304253304 |
oct | 5760152360612522 |
9 | 1015553840854432 |
10 | 210021011101010 |
11 | 60a1245759155a |
12 | 1b67b58b817902 |
13 | 9025b86417c45 |
14 | 39c10dd435974 |
15 | 19431dd8c3975 |
hex | bf0353c31552 |
210021011101010 has 8 divisors (see below), whose sum is σ = 378037819981836. Its totient is φ = 84008404440400.
The previous prime is 210021011100959. The next prime is 210021011101019. The reversal of 210021011101010 is 10101110120012.
It can be written as a sum of positive squares in 2 ways, for example, as 182460201575089 + 27560809525921 = 13507783^2 + 5249839^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 210021011100982 and 210021011101000.
It is not an unprimeable number, because it can be changed into a prime (210021011101019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10501050555041 + ... + 10501050555060.
Almost surely, 2210021011101010 is an apocalyptic number.
210021011101010 is a deficient number, since it is larger than the sum of its proper divisors (168016808880826).
210021011101010 is a wasteful number, since it uses less digits than its factorization.
210021011101010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21002101110108.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 210021011101010 its reverse (10101110120012), we get a palindrome (220122121221022).
The spelling of 210021011101010 in words is "two hundred ten trillion, twenty-one billion, eleven million, one hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •