Base | Representation |
---|---|
bin | 111100100101010100… |
… | …0110001111110100101 |
3 | 110102210222101220221011 |
4 | 1321022220301332211 |
5 | 4112421403121313 |
6 | 135433452422221 |
7 | 12254013103054 |
oct | 1711250617645 |
9 | 412728356834 |
10 | 130101223333 |
11 | 501a2826784 |
12 | 2126a777971 |
13 | c364b560b3 |
14 | 6422ad839b |
15 | 35b6baa93d |
hex | 1e4aa31fa5 |
130101223333 has 4 divisors (see below), whose sum is σ = 136948656160. Its totient is φ = 123253790508.
The previous prime is 130101223277. The next prime is 130101223361. The reversal of 130101223333 is 333322101031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 333322101031 = 173 ⋅1926717347.
It is a cyclic number.
It is not a de Polignac number, because 130101223333 - 29 = 130101222821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130101223433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3423716385 + ... + 3423716422.
It is an arithmetic number, because the mean of its divisors is an integer number (34237164040).
Almost surely, 2130101223333 is an apocalyptic number.
It is an amenable number.
130101223333 is a deficient number, since it is larger than the sum of its proper divisors (6847432827).
130101223333 is an equidigital number, since it uses as much as digits as its factorization.
130101223333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6847432826.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 130101223333 its reverse (333322101031), we get a palindrome (463423324364).
The spelling of 130101223333 in words is "one hundred thirty billion, one hundred one million, two hundred twenty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •