Base | Representation |
---|---|
bin | 1100000111111001001111… |
… | …1101000011101010110000 |
3 | 1202012022110021222122112112 |
4 | 3001332103331003222300 |
5 | 3221343330014313143 |
6 | 44203335421344452 |
7 | 2544021010425161 |
oct | 301762375035260 |
9 | 52168407878475 |
10 | 13329765776048 |
11 | 427a138302107 |
12 | 15b3493708128 |
13 | 758cb74a1357 |
14 | 341242441768 |
15 | 181b10104e18 |
hex | c1f93f43ab0 |
13329765776048 has 20 divisors (see below), whose sum is σ = 27185706517560. Its totient is φ = 6314099577984.
The previous prime is 13329765776023. The next prime is 13329765776137. The reversal of 13329765776048 is 84067756792331.
It is a hoax number, since the sum of its digits (68) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21923956565 + ... + 21923957172.
It is an arithmetic number, because the mean of its divisors is an integer number (1359285325878).
It is a 1-persistent number, because it is pandigital, but 2⋅13329765776048 = 26659531552096 is not.
Almost surely, 213329765776048 is an apocalyptic number.
It is an amenable number.
13329765776048 is an abundant number, since it is smaller than the sum of its proper divisors (13855940741512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13329765776048 is a wasteful number, since it uses less digits than its factorization.
13329765776048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43847913764 (or 43847913758 counting only the distinct ones).
The product of its (nonzero) digits is 320060160, while the sum is 68.
The spelling of 13329765776048 in words is "thirteen trillion, three hundred twenty-nine billion, seven hundred sixty-five million, seven hundred seventy-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •