Base | Representation |
---|---|
bin | 11101001010111011101… |
… | …11100010101110011101 |
3 | 10112211010011110101021101 |
4 | 32211131313202232131 |
5 | 112410203332034323 |
6 | 2044241251033101 |
7 | 132261661211146 |
oct | 16453567425635 |
9 | 3484104411241 |
10 | 1002302221213 |
11 | 35708a523857 |
12 | 142304b9b791 |
13 | 7369423aa07 |
14 | 367240d2acd |
15 | 1b113925dad |
hex | e95dde2b9d |
1002302221213 has 8 divisors (see below), whose sum is σ = 1061396871480. Its totient is φ = 943222648320.
The previous prime is 1002302221181. The next prime is 1002302221223. The reversal of 1002302221213 is 3121222032001.
It can be written as a sum of positive squares in 4 ways, for example, as 7571262169 + 994730959044 = 87013^2 + 997362^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1002302221213 - 25 = 1002302221181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002302221223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3632328 + ... + 3898513.
It is an arithmetic number, because the mean of its divisors is an integer number (132674608935).
Almost surely, 21002302221213 is an apocalyptic number.
It is an amenable number.
1002302221213 is a deficient number, since it is larger than the sum of its proper divisors (59094650267).
1002302221213 is an equidigital number, since it uses as much as digits as its factorization.
1002302221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7538687.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1002302221213 its reverse (3121222032001), we get a palindrome (4123524253214).
The spelling of 1002302221213 in words is "one trillion, two billion, three hundred two million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •