Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1111011010001110001 |
3 | 100202022100002221221021 |
4 | 1133000111323101301 |
5 | 3132404333033410 |
6 | 114510250255441 |
7 | 10240635033613 |
oct | 1370025732161 |
9 | 322270087837 |
10 | 102011221105 |
11 | 3a298747302 |
12 | 1792b427581 |
13 | 98093b53c1 |
14 | 4d1a1dadb3 |
15 | 29c0ab6eda |
hex | 17c057b471 |
102011221105 has 16 divisors (see below), whose sum is σ = 129825766224. Its totient is φ = 76683110400.
The previous prime is 102011221099. The next prime is 102011221163. The reversal of 102011221105 is 501122110201.
It can be written as a sum of positive squares in 8 ways, for example, as 7545354496 + 94465866609 = 86864^2 + 307353^2 .
It is not a de Polignac number, because 102011221105 - 215 = 102011188337 is a prime.
It is a super-4 number, since 4×1020112211054 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 926796 + ... + 1031005.
It is an arithmetic number, because the mean of its divisors is an integer number (8114110389).
Almost surely, 2102011221105 is an apocalyptic number.
It is an amenable number.
102011221105 is a deficient number, since it is larger than the sum of its proper divisors (27814545119).
102011221105 is a wasteful number, since it uses less digits than its factorization.
102011221105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1958436.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 102011221105 its reverse (501122110201), we get a palindrome (603133331306).
The spelling of 102011221105 in words is "one hundred two billion, eleven million, two hundred twenty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •