Base | Representation |
---|---|
bin | 11101011111011011000… |
… | …00110111101000001101 |
3 | 10120212111202201201001110 |
4 | 32233231200313220031 |
5 | 113100220321144323 |
6 | 2053300553202233 |
7 | 133131400000461 |
oct | 16575540675015 |
9 | 3525452651043 |
10 | 1013302131213 |
11 | 3608146aaa69 |
12 | 144474a00379 |
13 | 747281333b8 |
14 | 37088d7c4a1 |
15 | 1b559498793 |
hex | ebed837a0d |
1013302131213 has 32 divisors (see below), whose sum is σ = 1416141619200. Its totient is φ = 643694284800.
The previous prime is 1013302131199. The next prime is 1013302131241. The reversal of 1013302131213 is 3121312033101.
It is a happy number.
It is not a de Polignac number, because 1013302131213 - 210 = 1013302130189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1013302131213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013302138213) 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 31 ways as a sum of consecutive naturals, for example, 4977928 + ... + 5177486.
It is an arithmetic number, because the mean of its divisors is an integer number (44254425600).
Almost surely, 21013302131213 is an apocalyptic number.
It is an amenable number.
1013302131213 is a deficient number, since it is larger than the sum of its proper divisors (402839487987).
1013302131213 is a wasteful number, since it uses less digits than its factorization.
1013302131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200433.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1013302131213 its reverse (3121312033101), we get a palindrome (4134614164314).
The spelling of 1013302131213 in words is "one trillion, thirteen billion, three hundred two million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •