Base | Representation |
---|---|
bin | 1100000110001011001110… |
… | …0111000100010000010011 |
3 | 1202002111020001012000121212 |
4 | 3001202303213010100103 |
5 | 3220402333410023443 |
6 | 44142013044410335 |
7 | 2541624102421616 |
oct | 301426347042023 |
9 | 52074201160555 |
10 | 13300232111123 |
11 | 4268662321571 |
12 | 15a98109a69ab |
13 | 75628b905189 |
14 | 33da3dd0817d |
15 | 180e823e4618 |
hex | c18b39c4413 |
13300232111123 has 8 divisors (see below), whose sum is σ = 13780258741200. Its totient is φ = 12821632010208.
The previous prime is 13300232111071. The next prime is 13300232111129. The reversal of 13300232111123 is 32111123200331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13300232111123 - 216 = 13300232045587 is a prime.
It is a super-2 number, since 2×133002321111232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13300232111129) 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, 356613308 + ... + 356650601.
It is an arithmetic number, because the mean of its divisors is an integer number (1722532342650).
Almost surely, 213300232111123 is an apocalyptic number.
13300232111123 is a deficient number, since it is larger than the sum of its proper divisors (480026630077).
13300232111123 is an equidigital number, since it uses as much as digits as its factorization.
13300232111123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 713264581.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13300232111123 its reverse (32111123200331), we get a palindrome (45411355311454).
The spelling of 13300232111123 in words is "thirteen trillion, three hundred billion, two hundred thirty-two million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •