Base | Representation |
---|---|
bin | 1011110110100101001001… |
… | …0001100001101011111010 |
3 | 1201010212200011112120212110 |
4 | 2331221102101201223322 |
5 | 3202010133120232302 |
6 | 43414543331353150 |
7 | 2513360550421500 |
oct | 275512221415372 |
9 | 51125604476773 |
10 | 13032311102202 |
11 | 4174a76958047 |
12 | 15658ba7527b6 |
13 | 736c31ab1ac2 |
14 | 330aa538c670 |
15 | 179001126b6c |
hex | bda52461afa |
13032311102202 has 48 divisors (see below), whose sum is σ = 30360878868672. Its totient is φ = 3718505931840.
The previous prime is 13032311102189. The next prime is 13032311102339. The reversal of 13032311102202 is 20220111323031.
It is a super-2 number, since 2×130323111022022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29611699 + ... + 30048582.
It is an arithmetic number, because the mean of its divisors is an integer number (632518309764).
Almost surely, 213032311102202 is an apocalyptic number.
13032311102202 is an abundant number, since it is smaller than the sum of its proper divisors (17328567766470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032311102202 is a wasteful number, since it uses less digits than its factorization.
13032311102202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59661043 (or 59661036 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13032311102202 its reverse (20220111323031), we get a palindrome (33252422425233).
The spelling of 13032311102202 in words is "thirteen trillion, thirty-two billion, three hundred eleven million, one hundred two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •