Base | Representation |
---|---|
bin | 111100101110110110… |
… | …1011100110101000011 |
3 | 110110122021112011100000 |
4 | 1321131231130311003 |
5 | 4114100312331111 |
6 | 135525323131043 |
7 | 12264650014026 |
oct | 1713555346503 |
9 | 413567464300 |
10 | 130421214531 |
11 | 50347414913 |
12 | 21339973a83 |
13 | c3b62332ba |
14 | 64533d31bd |
15 | 35d4d17c56 |
hex | 1e5db5cd43 |
130421214531 has 24 divisors (see below), whose sum is σ = 205645760320. Its totient is φ = 82371290472.
The previous prime is 130421214509. The next prime is 130421214557. The reversal of 130421214531 is 135412124031.
130421214531 is a `hidden beast` number, since 1 + 3 + 0 + 4 + 2 + 121 + 4 + 531 = 666.
It is not a de Polignac number, because 130421214531 - 211 = 130421212483 is a prime.
It is a super-2 number, since 2×1304212145312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130421214495 and 130421214504.
It is not an unprimeable number, because it can be changed into a prime (130421214031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14119405 + ... + 14128638.
Almost surely, 2130421214531 is an apocalyptic number.
130421214531 is a deficient number, since it is larger than the sum of its proper divisors (75224545789).
130421214531 is an equidigital number, since it uses as much as digits as its factorization.
130421214531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28248077 (or 28248065 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 130421214531 its reverse (135412124031), we get a palindrome (265833338562).
The spelling of 130421214531 in words is "one hundred thirty billion, four hundred twenty-one million, two hundred fourteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •