Base | Representation |
---|---|
bin | 1100000110001110000110… |
… | …0001001110101110101110 |
3 | 1202002120012201111100112211 |
4 | 3001203201201032232232 |
5 | 3220410423044124402 |
6 | 44142221321121034 |
7 | 2541652144253011 |
oct | 301434141165656 |
9 | 52076181440484 |
10 | 13301002333102 |
11 | 4268a18073760 |
12 | 15a99a692917a |
13 | 756382360123 |
14 | 33dab4321378 |
15 | 180ec9d384d7 |
hex | c18e184ebae |
13301002333102 has 8 divisors (see below), whose sum is σ = 21765276545112. Its totient is φ = 6045910151400.
The previous prime is 13301002333097. The next prime is 13301002333103. The reversal of 13301002333102 is 20133320010331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 604591015141 = 13301002333102 / (1 + 3 + 3 + 0 + 1 + 0 + 0 + 2 + 3 + 3 + 3 + 1 + 0 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301002333103) 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, 302295507549 + ... + 302295507592.
It is an arithmetic number, because the mean of its divisors is an integer number (2720659568139).
Almost surely, 213301002333102 is an apocalyptic number.
13301002333102 is a deficient number, since it is larger than the sum of its proper divisors (8464274212010).
13301002333102 is a wasteful number, since it uses less digits than its factorization.
13301002333102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604591015154.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13301002333102 its reverse (20133320010331), we get a palindrome (33434322343433).
The spelling of 13301002333102 in words is "thirteen trillion, three hundred one billion, two million, three hundred thirty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •