Base | Representation |
---|---|
bin | 11101011111001000001… |
… | …10011010010011010010 |
3 | 10120212002202112222201011 |
4 | 32233210012122103102 |
5 | 113044404403403102 |
6 | 2053233152201134 |
7 | 133124441420005 |
oct | 16574406322322 |
9 | 3525082488634 |
10 | 1013144200402 |
11 | 360743541234 |
12 | 14442bb391aa |
13 | 747014b8709 |
14 | 37071dcb53c |
15 | 1b54a69e2d7 |
hex | ebe419a4d2 |
1013144200402 has 8 divisors (see below), whose sum is σ = 1520996604336. Its totient is φ = 506145332292.
The previous prime is 1013144200381. The next prime is 1013144200423. The reversal of 1013144200402 is 2040024413101.
It is a happy number.
1013144200402 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1013144200381) and next prime (1013144200423).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10131442004022 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213380988 + ... + 213385735.
It is an arithmetic number, because the mean of its divisors is an integer number (190124575542).
Almost surely, 21013144200402 is an apocalyptic number.
1013144200402 is a deficient number, since it is larger than the sum of its proper divisors (507852403934).
1013144200402 is a wasteful number, since it uses less digits than its factorization.
1013144200402 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 426767912.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 1013144200402 its reverse (2040024413101), we get a palindrome (3053168613503).
The spelling of 1013144200402 in words is "one trillion, thirteen billion, one hundred forty-four million, two hundred thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •