Base | Representation |
---|---|
bin | 100111101011000… |
… | …1010111011101101 |
3 | 10102202220120120122 |
4 | 1033112022323231 |
5 | 10211242241023 |
6 | 340032254325 |
7 | 44663054405 |
oct | 11726127355 |
9 | 3382816518 |
10 | 1331212013 |
11 | 62348631a |
12 | 3119a13a5 |
13 | 182a45821 |
14 | c8b27805 |
15 | 7bd082c8 |
hex | 4f58aeed |
1331212013 has 16 divisors (see below), whose sum is σ = 1474960896. Its totient is φ = 1195845120.
The previous prime is 1331212007. The next prime is 1331212021. The reversal of 1331212013 is 3102121331.
It is not a de Polignac number, because 1331212013 - 24 = 1331211997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1331211982 and 1331212000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331212093) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 21170 + ... + 55772.
It is an arithmetic number, because the mean of its divisors is an integer number (92185056).
Almost surely, 21331212013 is an apocalyptic number.
It is an amenable number.
1331212013 is a deficient number, since it is larger than the sum of its proper divisors (143748883).
1331212013 is a wasteful number, since it uses less digits than its factorization.
1331212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34724.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1331212013 is about 36485.7782293320. The cubic root of 1331212013 is about 1100.0584026843.
Adding to 1331212013 its reverse (3102121331), we get a palindrome (4433333344).
The spelling of 1331212013 in words is "one billion, three hundred thirty-one million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •