Base | Representation |
---|---|
bin | 10111001111001111010100… |
… | …011100010100010011110100 |
3 | 111101212110000210000002121010 |
4 | 113033033110130110103310 |
5 | 101343440313104020312 |
6 | 1001211032110352220 |
7 | 30345605353605453 |
oct | 2717172434242364 |
9 | 441773023002533 |
10 | 102202311001332 |
11 | 2a623836173713 |
12 | b5675ab1bb670 |
13 | 4504837723b99 |
14 | 1b34892676b9a |
15 | bc37b3a6793c |
hex | 5cf3d47144f4 |
102202311001332 has 48 divisors (see below), whose sum is σ = 240043152473600. Its totient is φ = 33843527565408.
The previous prime is 102202311001331. The next prime is 102202311001379. The reversal of 102202311001332 is 233100113202201.
It is a junction number, because it is equal to n+sod(n) for n = 102202311001299 and 102202311001308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202311001331) 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, 31744678 + ... + 34815645.
Almost surely, 2102202311001332 is an apocalyptic number.
102202311001332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102202311001332 is an abundant number, since it is smaller than the sum of its proper divisors (137840841472268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102202311001332 is a wasteful number, since it uses less digits than its factorization.
102202311001332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66561172 (or 66561170 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 102202311001332 its reverse (233100113202201), we get a palindrome (335302424203533).
The spelling of 102202311001332 in words is "one hundred two trillion, two hundred two billion, three hundred eleven million, one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •