Base | Representation |
---|---|
bin | 1011110110100100000001… |
… | …1001000110111111000111 |
3 | 1201010211220021000220100121 |
4 | 2331221000121012333013 |
5 | 3202004024320200403 |
6 | 43414453453322411 |
7 | 2513350245433012 |
oct | 275510031067707 |
9 | 51124807026317 |
10 | 13032011100103 |
11 | 4174932582026 |
12 | 1565836196407 |
13 | 736bb48b3078 |
14 | 330a775b8379 |
15 | 178ed4b173bd |
hex | bda40646fc7 |
13032011100103 has 16 divisors (see below), whose sum is σ = 13847172007680. Its totient is φ = 12241305328896.
The previous prime is 13032011100077. The next prime is 13032011100113. The reversal of 13032011100103 is 30100111023031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13032011100103 is a prime.
It is a super-2 number, since 2×130320111001032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032011100113) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 9933226 + ... + 11168392.
It is an arithmetic number, because the mean of its divisors is an integer number (865448250480).
Almost surely, 213032011100103 is an apocalyptic number.
13032011100103 is a deficient number, since it is larger than the sum of its proper divisors (815160907577).
13032011100103 is a wasteful number, since it uses less digits than its factorization.
13032011100103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245066.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 13032011100103 its reverse (30100111023031), we get a palindrome (43132122123134).
The spelling of 13032011100103 in words is "thirteen trillion, thirty-two billion, eleven million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •