Base | Representation |
---|---|
bin | 11101111000001001110111… |
… | …010000101101100011011101 |
3 | 122020020221010100202020210211 |
4 | 131320021313100231203131 |
5 | 114210343231430322141 |
6 | 1143245203512132421 |
7 | 36451332522614251 |
oct | 3570116720554335 |
9 | 566227110666724 |
10 | 131402230323421 |
11 | 38961411406512 |
12 | 128a2771097111 |
13 | 584223c279955 |
14 | 2463c8aa9a261 |
15 | 102d118414d81 |
hex | 77827742d8dd |
131402230323421 has 16 divisors (see below), whose sum is σ = 133126653215808. Its totient is φ = 129681186422400.
The previous prime is 131402230323367. The next prime is 131402230323439. The reversal of 131402230323421 is 124323032204131.
It is not a de Polignac number, because 131402230323421 - 225 = 131402196768989 is a prime.
It is a super-2 number, since 2×1314022303234212 (a number of 29 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 (131402230323491) 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, 1828016401 + ... + 1828088281.
It is an arithmetic number, because the mean of its divisors is an integer number (8320415825988).
Almost surely, 2131402230323421 is an apocalyptic number.
It is an amenable number.
131402230323421 is a deficient number, since it is larger than the sum of its proper divisors (1724422892387).
131402230323421 is an equidigital number, since it uses as much as digits as its factorization.
131402230323421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95052.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 131402230323421 its reverse (124323032204131), we get a palindrome (255725262527552).
The spelling of 131402230323421 in words is "one hundred thirty-one trillion, four hundred two billion, two hundred thirty million, three hundred twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •