Base | Representation |
---|---|
bin | 11101100101100001110111… |
… | …010100101001010010101101 |
3 | 122001201120110222120001202122 |
4 | 131211201313110221102231 |
5 | 114023411013230202313 |
6 | 1140425212414002325 |
7 | 36260012444665655 |
oct | 3545416724512255 |
9 | 561646428501678 |
10 | 130122331100333 |
11 | 38508630695550 |
12 | 127166b54a63a5 |
13 | 577b6386b3460 |
14 | 241bd50d4b365 |
15 | 1009ba9015708 |
hex | 7658775294ad |
130122331100333 has 16 divisors (see below), whose sum is σ = 152878435347456. Its totient is φ = 109188246728640.
The previous prime is 130122331100329. The next prime is 130122331100341. The reversal of 130122331100333 is 333001133221031.
It is a cyclic number.
It is not a de Polignac number, because 130122331100333 - 22 = 130122331100329 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130122331100303) 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, 19209710 + ... + 25085007.
It is an arithmetic number, because the mean of its divisors is an integer number (9554902209216).
Almost surely, 2130122331100333 is an apocalyptic number.
130122331100333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130122331100333 is a deficient number, since it is larger than the sum of its proper divisors (22756104247123).
130122331100333 is a wasteful number, since it uses less digits than its factorization.
130122331100333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44315284.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 130122331100333 its reverse (333001133221031), we get a palindrome (463123464321364).
The spelling of 130122331100333 in words is "one hundred thirty trillion, one hundred twenty-two billion, three hundred thirty-one million, one hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •