Base | Representation |
---|---|
bin | 1100000000111011100000… |
… | …0101111110111010000101 |
3 | 1201202212121111012102022012 |
4 | 3000032320011332322011 |
5 | 3212413302412330313 |
6 | 44032350411344005 |
7 | 2532253625623430 |
oct | 300167005767205 |
9 | 51685544172265 |
10 | 13210113011333 |
11 | 4233417453aa7 |
12 | 1594260152005 |
13 | 74a929212964 |
14 | 339531286817 |
15 | 17d95a88dda8 |
hex | c03b817ee85 |
13210113011333 has 8 divisors (see below), whose sum is σ = 15101309826240. Its totient is φ = 11319925649760.
The previous prime is 13210113011323. The next prime is 13210113011341. The reversal of 13210113011333 is 33311031101231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13210113011333 - 26 = 13210113011269 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13210113011299 and 13210113011308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210113011323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 252335288 + ... + 252387633.
It is an arithmetic number, because the mean of its divisors is an integer number (1887663728280).
Almost surely, 213210113011333 is an apocalyptic number.
It is an amenable number.
13210113011333 is a deficient number, since it is larger than the sum of its proper divisors (1891196814907).
13210113011333 is an equidigital number, since it uses as much as digits as its factorization.
13210113011333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504726667.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13210113011333 its reverse (33311031101231), we get a palindrome (46521144112564).
The spelling of 13210113011333 in words is "thirteen trillion, two hundred ten billion, one hundred thirteen million, eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •