Base | Representation |
---|---|
bin | 1011110110100100000001… |
… | …0000100100100110010111 |
3 | 1201010211220002211012101201 |
4 | 2331221000100210212113 |
5 | 3202004023232041403 |
6 | 43414453333333331 |
7 | 2513350220422150 |
oct | 275510020444627 |
9 | 51124802735351 |
10 | 13032008862103 |
11 | 4174931293640 |
12 | 1565835497247 |
13 | 736bb42ab4ca |
14 | 330a77194927 |
15 | 178ed482421d |
hex | bda40424997 |
13032008862103 has 64 divisors (see below), whose sum is σ = 17248245940224. Its totient is φ = 9545670288000.
The previous prime is 13032008862071. The next prime is 13032008862109. The reversal of 13032008862103 is 30126880023031.
It is not a de Polignac number, because 13032008862103 - 25 = 13032008862071 is a prime.
It is a super-2 number, since 2×130320088621032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032008862109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 38938825 + ... + 39272077.
It is an arithmetic number, because the mean of its divisors is an integer number (269503842816).
Almost surely, 213032008862103 is an apocalyptic number.
13032008862103 is a deficient number, since it is larger than the sum of its proper divisors (4216237078121).
13032008862103 is a wasteful number, since it uses less digits than its factorization.
13032008862103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333676.
The product of its (nonzero) digits is 41472, while the sum is 37.
Adding to 13032008862103 its reverse (30126880023031), we get a palindrome (43158888885134).
The spelling of 13032008862103 in words is "thirteen trillion, thirty-two billion, eight million, eight hundred sixty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •