Base | Representation |
---|---|
bin | 1011111100010110011000… |
… | …1110001100110100011111 |
3 | 1201111100111221021102220001 |
4 | 2333011212032030310133 |
5 | 3210121132041204211 |
6 | 43532255022035131 |
7 | 2523500035352350 |
oct | 277054616146437 |
9 | 51440457242801 |
10 | 13131430022431 |
11 | 420300aa03946 |
12 | 1580b61418aa7 |
13 | 743399bc0966 |
14 | 3357c93b9d27 |
15 | 17b8a2d20ac1 |
hex | bf16638cd1f |
13131430022431 has 32 divisors (see below), whose sum is σ = 16114718430720. Its totient is φ = 10443824004096.
The previous prime is 13131430022419. The next prime is 13131430022467. The reversal of 13131430022431 is 13422003413131.
It is not a de Polignac number, because 13131430022431 - 213 = 13131430014239 is a prime.
It is a super-2 number, since 2×131314300224312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13131430022431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13131430022401) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19995760 + ... + 20642026.
It is an arithmetic number, because the mean of its divisors is an integer number (503584950960).
Almost surely, 213131430022431 is an apocalyptic number.
13131430022431 is a deficient number, since it is larger than the sum of its proper divisors (2983288408289).
13131430022431 is a wasteful number, since it uses less digits than its factorization.
13131430022431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648703.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 13131430022431 its reverse (13422003413131), we get a palindrome (26553433435562).
The spelling of 13131430022431 in words is "thirteen trillion, one hundred thirty-one billion, four hundred thirty million, twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •