Base | Representation |
---|---|
bin | 1011110101111110110110… |
… | …1001101011011010100111 |
3 | 1201002220010212110220101100 |
4 | 2331133231221223122213 |
5 | 3201323110422000403 |
6 | 43410123412131143 |
7 | 2512545055122321 |
oct | 275375551533247 |
9 | 51086125426340 |
10 | 13022033000103 |
11 | 4170682165896 |
12 | 1563910606ab3 |
13 | 735c845c2a9a |
14 | 3303ac316611 |
15 | 178aedb332a3 |
hex | bd7eda6b6a7 |
13022033000103 has 24 divisors (see below), whose sum is σ = 19354249006560. Its totient is φ = 8433223905600.
The previous prime is 13022033000089. The next prime is 13022033000167. The reversal of 13022033000103 is 30100033022031.
13022033000103 is a `hidden beast` number, since 1 + 302 + 20 + 330 + 0 + 0 + 10 + 3 = 666.
It is not a de Polignac number, because 13022033000103 - 28 = 13022032999847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13022033040103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 135099643 + ... + 135195996.
It is an arithmetic number, because the mean of its divisors is an integer number (806427041940).
Almost surely, 213022033000103 is an apocalyptic number.
13022033000103 is a deficient number, since it is larger than the sum of its proper divisors (6332216006457).
13022033000103 is a wasteful number, since it uses less digits than its factorization.
13022033000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270295799 (or 270295796 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 13022033000103 its reverse (30100033022031), we get a palindrome (43122066022134).
The spelling of 13022033000103 in words is "thirteen trillion, twenty-two billion, thirty-three million, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •