Base | Representation |
---|---|
bin | 1100001100000111011101… |
… | …1101001011101100100110 |
3 | 1202110020200110212210221211 |
4 | 3003001313131023230212 |
5 | 3224040403314233220 |
6 | 44300533234502034 |
7 | 2552166353141062 |
oct | 303016735135446 |
9 | 52406613783854 |
10 | 13402302102310 |
11 | 42a7980159690 |
12 | 1605557a3491a |
13 | 762aa7226774 |
14 | 344963c42aa2 |
15 | 183958219b5a |
hex | c307774bb26 |
13402302102310 has 32 divisors (see below), whose sum is σ = 26317545138432. Its totient is φ = 4873509331680.
The previous prime is 13402302102307. The next prime is 13402302102337. The reversal of 13402302102310 is 1320120320431.
It is a super-2 number, since 2×134023021023102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 9816097 + ... + 11097763.
It is an arithmetic number, because the mean of its divisors is an integer number (822423285576).
Almost surely, 213402302102310 is an apocalyptic number.
13402302102310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13402302102310 is a deficient number, since it is larger than the sum of its proper divisors (12915243036122).
13402302102310 is a wasteful number, since it uses less digits than its factorization.
13402302102310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376748.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 13402302102310 its reverse (1320120320431), we get a palindrome (14722422422741).
The spelling of 13402302102310 in words is "thirteen trillion, four hundred two billion, three hundred two million, one hundred two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •