Base | Representation |
---|---|
bin | 111100101000101001… |
… | …1111110110011000011 |
3 | 110110002210010111120210 |
4 | 1321101103332303003 |
5 | 4113134040230311 |
6 | 135452533005203 |
7 | 12256543014510 |
oct | 1712123766303 |
9 | 413083114523 |
10 | 130213211331 |
11 | 5024aa65a45 |
12 | 212a0183803 |
13 | c382106298 |
14 | 643392a307 |
15 | 35c192c3a6 |
hex | 1e514fecc3 |
130213211331 has 16 divisors (see below), whose sum is σ = 203034554624. Its totient is φ = 72677140704.
The previous prime is 130213211329. The next prime is 130213211341. The reversal of 130213211331 is 133112312031.
It is a happy number.
It is not a de Polignac number, because 130213211331 - 21 = 130213211329 is a prime.
It is a super-2 number, since 2×1302132113312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130213211298 and 130213211307.
It is not an unprimeable number, because it can be changed into a prime (130213211311) 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, 72099436 + ... + 72101241.
It is an arithmetic number, because the mean of its divisors is an integer number (12689659664).
Almost surely, 2130213211331 is an apocalyptic number.
130213211331 is a deficient number, since it is larger than the sum of its proper divisors (72821343293).
130213211331 is a wasteful number, since it uses less digits than its factorization.
130213211331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144200730.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130213211331 its reverse (133112312031), we get a palindrome (263325523362).
The spelling of 130213211331 in words is "one hundred thirty billion, two hundred thirteen million, two hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •