Base | Representation |
---|---|
bin | 11000110010110011… |
… | …11001011110010110 |
3 | 1021100200020000122200 |
4 | 30121121321132112 |
5 | 204230121340202 |
6 | 10040503305330 |
7 | 650601443553 |
oct | 143131713626 |
9 | 37320200580 |
10 | 13311121302 |
11 | 57108654a6 |
12 | 26b5a4b246 |
13 | 134199484b |
14 | 903bd5a2a |
15 | 52d90ae1c |
hex | 319679796 |
13311121302 has 12 divisors (see below), whose sum is σ = 28840762860. Its totient is φ = 4437040428.
The previous prime is 13311121297. The next prime is 13311121337. The reversal of 13311121302 is 20312111331.
13311121302 is a `hidden beast` number, since 1 + 331 + 11 + 21 + 302 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 739506739 = 13311121302 / (1 + 3 + 3 + 1 + 1 + 1 + 2 + 1 + 3 + 0 + 2).
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 369753352 + ... + 369753387.
It is an arithmetic number, because the mean of its divisors is an integer number (2403396905).
Almost surely, 213311121302 is an apocalyptic number.
13311121302 is an abundant number, since it is smaller than the sum of its proper divisors (15529641558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13311121302 is a wasteful number, since it uses less digits than its factorization.
13311121302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739506747 (or 739506744 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13311121302 its reverse (20312111331), we get a palindrome (33623232633).
The spelling of 13311121302 in words is "thirteen billion, three hundred eleven million, one hundred twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •