Base | Representation |
---|---|
bin | 1100001100000110101101… |
… | …1110110011010100000011 |
3 | 1202110020011110211220222101 |
4 | 3003001223132303110003 |
5 | 3224040000401401011 |
6 | 44300501300451231 |
7 | 2552161363405330 |
oct | 303015336632403 |
9 | 52406143756871 |
10 | 13402101200131 |
11 | 42a788780a926 |
12 | 16055006a9b17 |
13 | 762a74714937 |
14 | 3449452a7987 |
15 | 1839457832c1 |
hex | c306b7b3503 |
13402101200131 has 16 divisors (see below), whose sum is σ = 15382466035200. Its totient is φ = 11438242671168.
The previous prime is 13402101200093. The next prime is 13402101200149. The reversal of 13402101200131 is 13100210120431.
It is a cyclic number.
It is not a de Polignac number, because 13402101200131 - 243 = 4606008177923 is a prime.
It is a super-2 number, since 2×134021012001312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13402101200099 and 13402101200108.
It is not an unprimeable number, because it can be changed into a prime (13402101200231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48375 + ... + 5177503.
It is an arithmetic number, because the mean of its divisors is an integer number (961404127200).
Almost surely, 213402101200131 is an apocalyptic number.
13402101200131 is a deficient number, since it is larger than the sum of its proper divisors (1980364835069).
13402101200131 is a wasteful number, since it uses less digits than its factorization.
13402101200131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5130738.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 13402101200131 its reverse (13100210120431), we get a palindrome (26502311320562).
The spelling of 13402101200131 in words is "thirteen trillion, four hundred two billion, one hundred one million, two hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •