Base | Representation |
---|---|
bin | 10111001100100101110101… |
… | …100010101100111101110000 |
3 | 111101020001022020001012220020 |
4 | 113030211311202230331300 |
5 | 101333000114013310412 |
6 | 1000551254230443440 |
7 | 30326503613461104 |
oct | 2714456542547560 |
9 | 441201266035806 |
10 | 102020330213232 |
11 | 2a563640817082 |
12 | b538282203580 |
13 | 44c0625600a92 |
14 | 1b29b4b783904 |
15 | bbdbb24e418c |
hex | 5cc9758acf70 |
102020330213232 has 40 divisors (see below), whose sum is σ = 279055609114896. Its totient is φ = 32006378105856.
The previous prime is 102020330213209. The next prime is 102020330213233. The reversal of 102020330213232 is 232312033020201.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102020330213233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62512456423 + ... + 62512458054.
Almost surely, 2102020330213232 is an apocalyptic number.
102020330213232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102020330213232 is an abundant number, since it is smaller than the sum of its proper divisors (177035278901664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020330213232 is a wasteful number, since it uses less digits than its factorization.
102020330213232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125024914505 (or 125024914499 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 102020330213232 its reverse (232312033020201), we get a palindrome (334332363233433).
The spelling of 102020330213232 in words is "one hundred two trillion, twenty billion, three hundred thirty million, two hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •