Base | Representation |
---|---|
bin | 11101100100000100100010… |
… | …011101100100110010010011 |
3 | 122001100222211022120201212010 |
4 | 131210010202131210302103 |
5 | 114020240302010130003 |
6 | 1140311201101234003 |
7 | 36246534264205656 |
oct | 3544044235446223 |
9 | 561328738521763 |
10 | 130022123130003 |
11 | 3847a088923245 |
12 | 126bb1a9b62903 |
13 | 5772058a88960 |
14 | 241716643189d |
15 | 10072918ea003 |
hex | 764122764c93 |
130022123130003 has 32 divisors (see below), whose sum is σ = 194819684935680. Its totient is φ = 76533218087040.
The previous prime is 130022123130001. The next prime is 130022123130013. The reversal of 130022123130003 is 300031321220031.
It is not a de Polignac number, because 130022123130003 - 21 = 130022123130001 is a prime.
It is a super-2 number, since 2×1300221231300032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130022123130001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 43827238 + ... + 46699796.
It is an arithmetic number, because the mean of its divisors is an integer number (6088115154240).
Almost surely, 2130022123130003 is an apocalyptic number.
130022123130003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
130022123130003 is a deficient number, since it is larger than the sum of its proper divisors (64797561805677).
130022123130003 is a wasteful number, since it uses less digits than its factorization.
130022123130003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2923059.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 130022123130003 its reverse (300031321220031), we get a palindrome (430053444350034).
The spelling of 130022123130003 in words is "one hundred thirty trillion, twenty-two billion, one hundred twenty-three million, one hundred thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •