Base | Representation |
---|---|
bin | 11101011111000011001… |
… | …10001111100010110110 |
3 | 10120211222211112211020101 |
4 | 32233201212033202312 |
5 | 113044313131311202 |
6 | 2053225052224314 |
7 | 133123421504434 |
oct | 16574146174266 |
9 | 3524884484211 |
10 | 1013102213302 |
11 | 360721873753 |
12 | 144419a6b09a |
13 | 746c58a758a |
14 | 3706a5bbd54 |
15 | 1b546b58887 |
hex | ebe198f8b6 |
1013102213302 has 8 divisors (see below), whose sum is σ = 1519685020656. Its totient is φ = 506540539752.
The previous prime is 1013102213251. The next prime is 1013102213309. The reversal of 1013102213302 is 2033122013101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10131022133022 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1013102213302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013102213309) 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 3 ways as a sum of consecutive naturals, for example, 5163058 + ... + 5355685.
It is an arithmetic number, because the mean of its divisors is an integer number (189960627582).
Almost surely, 21013102213302 is an apocalyptic number.
1013102213302 is a deficient number, since it is larger than the sum of its proper divisors (506582807354).
1013102213302 is a wasteful number, since it uses less digits than its factorization.
1013102213302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10566902.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1013102213302 its reverse (2033122013101), we get a palindrome (3046224226403).
The spelling of 1013102213302 in words is "one trillion, thirteen billion, one hundred two million, two hundred thirteen thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •