Base | Representation |
---|---|
bin | 1011110110100100000011… |
… | …1011011100010001101011 |
3 | 1201010211220212222011011122 |
4 | 2331221000323130101223 |
5 | 3202004034121201303 |
6 | 43414454414245455 |
7 | 2513350415066246 |
oct | 275510073342153 |
9 | 51124825864148 |
10 | 13032020100203 |
11 | 4174937669a25 |
12 | 15658391b688b |
13 | 736bb6714780 |
14 | 330a7887c25d |
15 | 178ed57e3e38 |
hex | bda40edc46b |
13032020100203 has 16 divisors (see below), whose sum is σ = 14860200158496. Its totient is φ = 11321814766080.
The previous prime is 13032020100149. The next prime is 13032020100221. The reversal of 13032020100203 is 30200102023031.
It is not a de Polignac number, because 13032020100203 - 28 = 13032020099947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is not an unprimeable number, because it can be changed into a prime (13032020100703) 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, 24920408 + ... + 25437978.
It is an arithmetic number, because the mean of its divisors is an integer number (928762509906).
Almost surely, 213032020100203 is an apocalyptic number.
13032020100203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13032020100203 is a deficient number, since it is larger than the sum of its proper divisors (1828180058293).
13032020100203 is a wasteful number, since it uses less digits than its factorization.
13032020100203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631534.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 13032020100203 its reverse (30200102023031), we get a palindrome (43232122123234).
The spelling of 13032020100203 in words is "thirteen trillion, thirty-two billion, twenty million, one hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •