Base | Representation |
---|---|
bin | 1011111010100010110011… |
… | …0001011010001000110110 |
3 | 1201101101102111110020010120 |
4 | 2332220230301122020312 |
5 | 3204114110224334142 |
6 | 43510124043032410 |
7 | 2521321105422345 |
oct | 276505461321066 |
9 | 51341374406116 |
10 | 13100401402422 |
11 | 41a0938079434 |
12 | 1576b41b0b706 |
13 | 7404936aa889 |
14 | 3340c44d3b5c |
15 | 17ab88c607ec |
hex | bea2cc5a236 |
13100401402422 has 16 divisors (see below), whose sum is σ = 26201493645312. Its totient is φ = 4366685327400.
The previous prime is 13100401402409. The next prime is 13100401402423. The reversal of 13100401402422 is 22420410400131.
13100401402422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13100401402392 and 13100401402401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100401402423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28538338 + ... + 28993749.
It is an arithmetic number, because the mean of its divisors is an integer number (1637593352832).
Almost surely, 213100401402422 is an apocalyptic number.
13100401402422 is an abundant number, since it is smaller than the sum of its proper divisors (13101092242890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13100401402422 is a wasteful number, since it uses less digits than its factorization.
13100401402422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57570043.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 13100401402422 its reverse (22420410400131), we get a palindrome (35520811802553).
The spelling of 13100401402422 in words is "thirteen trillion, one hundred billion, four hundred one million, four hundred two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.900 sec. • engine limits •