Base | Representation |
---|---|
bin | 11101001100011101010… |
… | …11110100100101010101 |
3 | 10112220020020120110011010 |
4 | 32212032223310211111 |
5 | 112413343013412323 |
6 | 2044454425202433 |
7 | 132321164534262 |
oct | 16461653644525 |
9 | 3486206513133 |
10 | 1003121232213 |
11 | 35746a869951 |
12 | 1424b3330419 |
13 | 73794b18ac9 |
14 | 367a0baa269 |
15 | 1b1607a5c93 |
hex | e98eaf4955 |
1003121232213 has 8 divisors (see below), whose sum is σ = 1407889448800. Its totient is φ = 633550251888.
The previous prime is 1003121232199. The next prime is 1003121232233. The reversal of 1003121232213 is 3122321213001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1003121232213 - 25 = 1003121232181 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1003121232213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003121232233) 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, 8799308998 + ... + 8799309111.
It is an arithmetic number, because the mean of its divisors is an integer number (175986181100).
Almost surely, 21003121232213 is an apocalyptic number.
It is an amenable number.
1003121232213 is a deficient number, since it is larger than the sum of its proper divisors (404768216587).
1003121232213 is a wasteful number, since it uses less digits than its factorization.
1003121232213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17598618131.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1003121232213 its reverse (3122321213001), we get a palindrome (4125442445214).
The spelling of 1003121232213 in words is "one trillion, three billion, one hundred twenty-one million, two hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •