Base | Representation |
---|---|
bin | 1100001100000111110111… |
… | …1101110100111010010111 |
3 | 1202110020222002101210121201 |
4 | 3003001331331310322113 |
5 | 3224041114244314111 |
6 | 44300552135453331 |
7 | 2552202150405613 |
oct | 303017575647227 |
9 | 52406862353551 |
10 | 13402411323031 |
11 | 42a7a26878845 |
12 | 1605588527247 |
13 | 762ac3a48203 |
14 | 344974554343 |
15 | 183962ae16c1 |
hex | c307df74e97 |
13402411323031 has 4 divisors (see below), whose sum is σ = 13491169014064. Its totient is φ = 13313653632000.
The previous prime is 13402411323029. The next prime is 13402411323047. The reversal of 13402411323031 is 13032311420431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13402411323031 - 21 = 13402411323029 is a prime.
It is a super-2 number, since 2×134024113230312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13402411324031) 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, 44378845290 + ... + 44378845591.
It is an arithmetic number, because the mean of its divisors is an integer number (3372792253516).
Almost surely, 213402411323031 is an apocalyptic number.
13402411323031 is a deficient number, since it is larger than the sum of its proper divisors (88757691033).
13402411323031 is an equidigital number, since it uses as much as digits as its factorization.
13402411323031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88757691032.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 13402411323031 its reverse (13032311420431), we get a palindrome (26434722743462).
The spelling of 13402411323031 in words is "thirteen trillion, four hundred two billion, four hundred eleven million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •