Base | Representation |
---|---|
bin | 11101100111001000001100… |
… | …110011101010111101011101 |
3 | 122002010002002212011011101101 |
4 | 131213020030303222331131 |
5 | 114032211033041034323 |
6 | 1140551504113113101 |
7 | 36300652435420345 |
oct | 3547101463527535 |
9 | 562102085134341 |
10 | 130232213221213 |
11 | 385501982422a4 |
12 | 12733a60858791 |
13 | 5788aca6498ac |
14 | 24233b6607d25 |
15 | 100c98aac5dad |
hex | 76720cceaf5d |
130232213221213 has 16 divisors (see below), whose sum is σ = 131723553265920. Its totient is φ = 128748500524800.
The previous prime is 130232213221207. The next prime is 130232213221249. The reversal of 130232213221213 is 312122312232031.
It is a cyclic number.
It is not a de Polignac number, because 130232213221213 - 241 = 128033189965661 is a prime.
It is a super-2 number, since 2×1302322132212132 (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 (130232213221613) 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, 371058553 + ... + 371409361.
It is an arithmetic number, because the mean of its divisors is an integer number (8232722079120).
Almost surely, 2130232213221213 is an apocalyptic number.
It is an amenable number.
130232213221213 is a deficient number, since it is larger than the sum of its proper divisors (1491340044707).
130232213221213 is a wasteful number, since it uses less digits than its factorization.
130232213221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361668.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 130232213221213 its reverse (312122312232031), we get a palindrome (442354525453244).
The spelling of 130232213221213 in words is "one hundred thirty trillion, two hundred thirty-two billion, two hundred thirteen million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •