Base | Representation |
---|---|
bin | 10111010001000110100010… |
… | …100011011000111001100100 |
3 | 111102022200110011012002012121 |
4 | 113101012202203120321210 |
5 | 101403040000142410340 |
6 | 1001345522412155324 |
7 | 30361056541010221 |
oct | 2721064243307144 |
9 | 442280404162177 |
10 | 102330323013220 |
11 | 2a67305665a965 |
12 | b588376168b44 |
13 | 4513928798893 |
14 | 1b3ab57ad2948 |
15 | bc6ca70dc94a |
hex | 5d11a28d8e64 |
102330323013220 has 48 divisors (see below), whose sum is σ = 226215170193600. Its totient is φ = 38775869769600.
The previous prime is 102330323013179. The next prime is 102330323013221. The reversal of 102330323013220 is 22310323033201.
It is not an unprimeable number, because it can be changed into a prime (102330323013221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 904246 + ... + 14334514.
It is an arithmetic number, because the mean of its divisors is an integer number (4712816045700).
Almost surely, 2102330323013220 is an apocalyptic number.
102330323013220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102330323013220 is an abundant number, since it is smaller than the sum of its proper divisors (123884847180380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102330323013220 is a wasteful number, since it uses less digits than its factorization.
102330323013220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13450348 (or 13450346 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 102330323013220 its reverse (22310323033201), we get a palindrome (124640646046421).
The spelling of 102330323013220 in words is "one hundred two trillion, three hundred thirty billion, three hundred twenty-three million, thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •