Base | Representation |
---|---|
bin | 101111110100010001010101… |
… | …011100011110110110011111 |
3 | 1000120121111121101002210001101 |
4 | 233310101111130132312133 |
5 | 210031024313311223403 |
6 | 2023134330032053531 |
7 | 62203455206450650 |
oct | 5764212534366637 |
9 | 1016544541083041 |
10 | 210300212211103 |
11 | 6100a901306a43 |
12 | 1b70570b6942a7 |
13 | 90462c01b73b1 |
14 | 39d0828135527 |
15 | 194a5d010d71d |
hex | bf445571ed9f |
210300212211103 has 64 divisors (see below), whose sum is σ = 262666989527040. Its totient is φ = 164345586532992.
The previous prime is 210300212211059. The next prime is 210300212211121. The reversal of 210300212211103 is 301112212003012.
It is not a de Polignac number, because 210300212211103 - 213 = 210300212202911 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210300212211403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 338259150 + ... + 338880292.
It is an arithmetic number, because the mean of its divisors is an integer number (4104171711360).
Almost surely, 2210300212211103 is an apocalyptic number.
210300212211103 is a deficient number, since it is larger than the sum of its proper divisors (52366777315937).
210300212211103 is a wasteful number, since it uses less digits than its factorization.
210300212211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621956.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 210300212211103 its reverse (301112212003012), we get a palindrome (511412424214115).
The spelling of 210300212211103 in words is "two hundred ten trillion, three hundred billion, two hundred twelve million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •