Base | Representation |
---|---|
bin | 10111001110001110000010… |
… | …101101100000111111110100 |
3 | 111101121202010000222121200002 |
4 | 113032032002231200333310 |
5 | 101341313241344120200 |
6 | 1001114521055410432 |
7 | 30340544425516310 |
oct | 2716160255407764 |
9 | 441552100877602 |
10 | 102132220301300 |
11 | 2a5a7038862342 |
12 | b555aa9b23a18 |
13 | 44cb047570a97 |
14 | 1b313239b0b40 |
15 | bc1a604dcbd5 |
hex | 5ce382b60ff4 |
102132220301300 has 36 divisors (see below), whose sum is σ = 253287906348960. Its totient is φ = 35016761245920.
The previous prime is 102132220301299. The next prime is 102132220301357. The reversal of 102132220301300 is 3103022231201.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72951585230 + ... + 72951586629.
It is an arithmetic number, because the mean of its divisors is an integer number (7035775176360).
Almost surely, 2102132220301300 is an apocalyptic number.
102132220301300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102132220301300 is an abundant number, since it is smaller than the sum of its proper divisors (151155686047660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102132220301300 is a wasteful number, since it uses less digits than its factorization.
102132220301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145903171880 (or 145903171873 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 102132220301300 its reverse (3103022231201), we get a palindrome (105235242532501).
The spelling of 102132220301300 in words is "one hundred two trillion, one hundred thirty-two billion, two hundred twenty million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •