Base | Representation |
---|---|
bin | 1011111100011101011110… |
… | …1001111110101100010001 |
3 | 1201111112102120022022200121 |
4 | 2333013113221332230101 |
5 | 3210134031240130001 |
6 | 43533211524150241 |
7 | 2523565144454050 |
oct | 277072751765421 |
9 | 51445376268617 |
10 | 13133333130001 |
11 | 42038a7191817 |
12 | 15813b2838381 |
13 | 743611271b06 |
14 | 33592a052397 |
15 | 17b964e446a1 |
hex | bf1d7a7eb11 |
13133333130001 has 4 divisors (see below), whose sum is σ = 15009523577152. Its totient is φ = 11257142682852.
The previous prime is 13133333129923. The next prime is 13133333130011. The reversal of 13133333130001 is 10003133333131.
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.
It is a cyclic number.
It is not a de Polignac number, because 13133333130001 - 213 = 13133333121809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13133333130011) 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, 938095223565 + ... + 938095223578.
It is an arithmetic number, because the mean of its divisors is an integer number (3752380894288).
Almost surely, 213133333130001 is an apocalyptic number.
It is an amenable number.
13133333130001 is a deficient number, since it is larger than the sum of its proper divisors (1876190447151).
13133333130001 is an equidigital number, since it uses as much as digits as its factorization.
13133333130001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876190447150.
The product of its (nonzero) digits is 2187, while the sum is 25.
Adding to 13133333130001 its reverse (10003133333131), we get a palindrome (23136466463132).
The spelling of 13133333130001 in words is "thirteen trillion, one hundred thirty-three billion, three hundred thirty-three million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •