Base | Representation |
---|---|
bin | 1011110100111000101111… |
… | …0110100001111111010011 |
3 | 1201001002120020001221202012 |
4 | 2331032023312201333103 |
5 | 3201021034324124021 |
6 | 43353332052013135 |
7 | 2511310503105635 |
oct | 275161366417723 |
9 | 51032506057665 |
10 | 13003212333011 |
11 | 41636a440706a |
12 | 15601396011ab |
13 | 734275354694 |
14 | 32d504900a55 |
15 | 17839b6be35b |
hex | bd38bda1fd3 |
13003212333011 has 8 divisors (see below), whose sum is σ = 13568645258784. Its totient is φ = 12437785729600.
The previous prime is 13003212332939. The next prime is 13003212333047. The reversal of 13003212333011 is 11033321230031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13003212333011 is a prime.
It is a super-2 number, since 2×130032123330112 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is not an unprimeable number, because it can be changed into a prime (13003212333061) 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, 2891495 + ... + 5862351.
It is an arithmetic number, because the mean of its divisors is an integer number (1696080657348).
Almost surely, 213003212333011 is an apocalyptic number.
13003212333011 is a deficient number, since it is larger than the sum of its proper divisors (565432925773).
13003212333011 is a wasteful number, since it uses less digits than its factorization.
13003212333011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3161181.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 13003212333011 its reverse (11033321230031), we get a palindrome (24036533563042).
The spelling of 13003212333011 in words is "thirteen trillion, three billion, two hundred twelve million, three hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •