Base | Representation |
---|---|
bin | 1100001000000110101100… |
… | …1001000100111000001001 |
3 | 1202012122202220022110102001 |
4 | 3002001223021010320021 |
5 | 3221423223230400134 |
6 | 44205133545511001 |
7 | 2544206326156441 |
oct | 302015311047011 |
9 | 52178686273361 |
10 | 13333376028169 |
11 | 4280720192a4a |
12 | 15b41207a2461 |
13 | 759441430a02 |
14 | 3414a5add121 |
15 | 181c7203e414 |
hex | c206b244e09 |
13333376028169 has 4 divisors (see below), whose sum is σ = 13643454540496. Its totient is φ = 13023297515844.
The previous prime is 13333376028163. The next prime is 13333376028223. The reversal of 13333376028169 is 96182067333331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13333376028169 - 223 = 13333367639561 is a prime.
It is a super-2 number, since 2×133333760281692 (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 (13333376028163) 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, 155039256099 + ... + 155039256184.
It is an arithmetic number, because the mean of its divisors is an integer number (3410863635124).
Almost surely, 213333376028169 is an apocalyptic number.
It is an amenable number.
13333376028169 is a deficient number, since it is larger than the sum of its proper divisors (310078512327).
13333376028169 is an equidigital number, since it uses as much as digits as its factorization.
13333376028169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 310078512326.
The product of its (nonzero) digits is 8817984, while the sum is 55.
The spelling of 13333376028169 in words is "thirteen trillion, three hundred thirty-three billion, three hundred seventy-six million, twenty-eight thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •