Base | Representation |
---|---|
bin | 1100000111000000000000… |
… | …1001010000001111001010 |
3 | 1202010211210111112100201110 |
4 | 3001300000021100033022 |
5 | 3221120343131342102 |
6 | 44152315034031150 |
7 | 2542635161361234 |
oct | 301600011201712 |
9 | 52124714470643 |
10 | 13314401043402 |
11 | 4273673313058 |
12 | 15b0505b784b6 |
13 | 757709211384 |
14 | 3405c59d7254 |
15 | 18151129686c |
hex | c1c002503ca |
13314401043402 has 8 divisors (see below), whose sum is σ = 26628802086816. Its totient is φ = 4438133681132.
The previous prime is 13314401043373. The next prime is 13314401043403. The reversal of 13314401043402 is 20434010441331.
It is a sphenic number, since it is the product of 3 distinct primes.
13314401043402 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 13314401043402.
It is not an unprimeable number, because it can be changed into a prime (13314401043403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1109533420278 + ... + 1109533420289.
It is an arithmetic number, because the mean of its divisors is an integer number (3328600260852).
Almost surely, 213314401043402 is an apocalyptic number.
13314401043402 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13314401043402 is a wasteful number, since it uses less digits than its factorization.
13314401043402 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2219066840572.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 13314401043402 its reverse (20434010441331), we get a palindrome (33748411484733).
The spelling of 13314401043402 in words is "thirteen trillion, three hundred fourteen billion, four hundred one million, forty-three thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •