Base | Representation |
---|---|
bin | 1100000111011000101000… |
… | …1000010110111111100001 |
3 | 1202011110212011101120111012 |
4 | 3001312022020112333201 |
5 | 3221222412311011113 |
6 | 44155331001030305 |
7 | 2543261033350145 |
oct | 301661210267741 |
9 | 52143764346435 |
10 | 13321011032033 |
11 | 42764554a4381 |
12 | 15b184b785395 |
13 | 758220792353 |
14 | 340a5182d225 |
15 | 18179b721aa8 |
hex | c1d8a216fe1 |
13321011032033 has 8 divisors (see below), whose sum is σ = 13620385769088. Its totient is φ = 13022300835504.
The previous prime is 13321011032011. The next prime is 13321011032071. The reversal of 13321011032033 is 33023011012331.
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-13321011032033 is a prime.
It is a super-2 number, since 2×133210110320332 (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 (13321011032093) 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, 166094591 + ... + 166174772.
It is an arithmetic number, because the mean of its divisors is an integer number (1702548221136).
Almost surely, 213321011032033 is an apocalyptic number.
It is an amenable number.
13321011032033 is a deficient number, since it is larger than the sum of its proper divisors (299374737055).
13321011032033 is an equidigital number, since it uses as much as digits as its factorization.
13321011032033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332270263.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 13321011032033 its reverse (33023011012331), we get a palindrome (46344022044364).
The spelling of 13321011032033 in words is "thirteen trillion, three hundred twenty-one billion, eleven million, thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •