Base | Representation |
---|---|
bin | 101111100010111100… |
… | …1011011000010101101 |
3 | 100202112211110120021020 |
4 | 1133011321123002231 |
5 | 3133102212143313 |
6 | 114523415524353 |
7 | 10243146120300 |
oct | 1370571330255 |
9 | 322484416236 |
10 | 102104412333 |
11 | 3a336308250 |
12 | 179566896b9 |
13 | 98227b3a41 |
14 | 4d28738b37 |
15 | 29c8d74323 |
hex | 17c5e5b0ad |
102104412333 has 24 divisors (see below), whose sum is σ = 172762941600. Its totient is φ = 53041252320.
The previous prime is 102104412323. The next prime is 102104412343. The reversal of 102104412333 is 333214401201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (102104412323) and next prime (102104412343).
It is not a de Polignac number, because 102104412333 - 213 = 102104404141 is a prime.
It is a super-2 number, since 2×1021044123332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102104412313) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31570558 + ... + 31573791.
It is an arithmetic number, because the mean of its divisors is an integer number (7198455900).
Almost surely, 2102104412333 is an apocalyptic number.
It is an amenable number.
102104412333 is a deficient number, since it is larger than the sum of its proper divisors (70658529267).
102104412333 is a wasteful number, since it uses less digits than its factorization.
102104412333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63144377 (or 63144370 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 102104412333 its reverse (333214401201), we get a palindrome (435318813534).
The spelling of 102104412333 in words is "one hundred two billion, one hundred four million, four hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •