Base | Representation |
---|---|
bin | 101111110010110111000101… |
… | …110011110000000011000000 |
3 | 1000120021020111022100111002121 |
4 | 233302313011303300003000 |
5 | 210022432341124024412 |
6 | 2023022022520054024 |
7 | 62163455024626420 |
oct | 5762670563600300 |
9 | 1016236438314077 |
10 | 210203313111232 |
11 | 60a827a7298021 |
12 | 1b6aa988304314 |
13 | 903a119c595cc |
14 | 39c9c74c64480 |
15 | 1947d0d249107 |
hex | bf2dc5cf00c0 |
210203313111232 has 28 divisors (see below), whose sum is σ = 476711085092560. Its totient is φ = 90087134190336.
The previous prime is 210203313111137. The next prime is 210203313111271. The reversal of 210203313111232 is 232111313302012.
It is a tau number, because it is divible by the number of its divisors (28).
It is a junction number, because it is equal to n+sod(n) for n = 210203313111197 and 210203313111206.
It is an unprimeable number.
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, 234601911507 + ... + 234601912402.
Almost surely, 2210203313111232 is an apocalyptic number.
It is an amenable number.
210203313111232 is an abundant number, since it is smaller than the sum of its proper divisors (266507771981328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210203313111232 is an equidigital number, since it uses as much as digits as its factorization.
210203313111232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469203823928 (or 469203823918 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 210203313111232 its reverse (232111313302012), we get a palindrome (442314626413244).
The spelling of 210203313111232 in words is "two hundred ten trillion, two hundred three billion, three hundred thirteen million, one hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •