Base | Representation |
---|---|
bin | 1011110101111011011100… |
… | …1111010100110011110110 |
3 | 1201002210210020201220012000 |
4 | 2331132313033110303312 |
5 | 3201314223222401402 |
6 | 43405453042040130 |
7 | 2512513331566401 |
oct | 275366717246366 |
9 | 51083706656160 |
10 | 13021120122102 |
11 | 4170253938064 |
12 | 15636b6949046 |
13 | 735b6a43a8a1 |
14 | 330322da6d38 |
15 | 178a98910c1c |
hex | bd7b73d4cf6 |
13021120122102 has 32 divisors (see below), whose sum is σ = 28936046136960. Its totient is φ = 4340339827560.
The previous prime is 13021120122079. The next prime is 13021120122119. The reversal of 13021120122102 is 20122102112031.
13021120122102 is a `hidden beast` number, since 1 + 30 + 211 + 201 + 221 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 6691777 + ... + 8415587.
It is an arithmetic number, because the mean of its divisors is an integer number (904251441780).
Almost surely, 213021120122102 is an apocalyptic number.
13021120122102 is an abundant number, since it is smaller than the sum of its proper divisors (15914926014858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13021120122102 is a wasteful number, since it uses less digits than its factorization.
13021120122102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1863705 (or 1863699 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 13021120122102 its reverse (20122102112031), we get a palindrome (33143222234133).
The spelling of 13021120122102 in words is "thirteen trillion, twenty-one billion, one hundred twenty million, one hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •