Base | Representation |
---|---|
bin | 11101101000100110001010… |
… | …111001111010000100110101 |
3 | 122002110201112201221200101001 |
4 | 131220212022321322010311 |
5 | 114040334203414024023 |
6 | 1141110112222203301 |
7 | 36311154016602022 |
oct | 3550461271720465 |
9 | 562421481850331 |
10 | 130333113033013 |
11 | 38589a65591310 |
12 | 1274b51ba23531 |
13 | 579548a6b8147 |
14 | 2428228d76549 |
15 | 10103e3d016ad |
hex | 76898ae7a135 |
130333113033013 has 16 divisors (see below), whose sum is σ = 143590839243840. Its totient is φ = 117310288608000.
The previous prime is 130333113032989. The next prime is 130333113033043. The reversal of 130333113033013 is 310330311333031.
It is a cyclic number.
It is not a de Polignac number, because 130333113033013 - 29 = 130333113032501 is a prime.
It is a super-2 number, since 2×1303331130330132 (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 (130333113033043) 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, 113605606 + ... + 114747112.
It is an arithmetic number, because the mean of its divisors is an integer number (8974427452740).
Almost surely, 2130333113033013 is an apocalyptic number.
It is an amenable number.
130333113033013 is a deficient number, since it is larger than the sum of its proper divisors (13257726210827).
130333113033013 is a wasteful number, since it uses less digits than its factorization.
130333113033013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1244388.
The product of its (nonzero) digits is 6561, while the sum is 28.
Adding to 130333113033013 its reverse (310330311333031), we get a palindrome (440663424366044).
The spelling of 130333113033013 in words is "one hundred thirty trillion, three hundred thirty-three billion, one hundred thirteen million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •