Base | Representation |
---|---|
bin | 1011110111011010001101… |
… | …0010010010010000011101 |
3 | 1201012020102212020120102022 |
4 | 2331312203102102100131 |
5 | 3202223321110020113 |
6 | 43425301003105525 |
7 | 2514403541042552 |
oct | 275664322222035 |
9 | 51166385216368 |
10 | 13046555157533 |
11 | 41800162996a7 |
12 | 1568614b122a5 |
13 | 738391b31601 |
14 | 331657034a29 |
15 | 1795868b7908 |
hex | bdda349241d |
13046555157533 has 8 divisors (see below), whose sum is σ = 13147529989440. Its totient is φ = 12945681964800.
The previous prime is 13046555157491. The next prime is 13046555157563. The reversal of 13046555157533 is 33575155564031.
13046555157533 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13046555157533 - 230 = 13045481415709 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13046555157563) 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, 25152068 + ... + 25665533.
It is an arithmetic number, because the mean of its divisors is an integer number (1643441248680).
Almost surely, 213046555157533 is an apocalyptic number.
It is an amenable number.
13046555157533 is a deficient number, since it is larger than the sum of its proper divisors (100974831907).
13046555157533 is a wasteful number, since it uses less digits than its factorization.
13046555157533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50819587.
The product of its (nonzero) digits is 14175000, while the sum is 53.
The spelling of 13046555157533 in words is "thirteen trillion, forty-six billion, five hundred fifty-five million, one hundred fifty-seven thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •