Base | Representation |
---|---|
bin | 1100001001001111111111… |
… | …1110111110101010001001 |
3 | 1202021112120020010000121201 |
4 | 3002103333332332222021 |
5 | 3222234023040240000 |
6 | 44222150300504201 |
7 | 2545504050144433 |
oct | 302237776765211 |
9 | 52245506100551 |
10 | 13353053055625 |
11 | 4288aa8377a08 |
12 | 15b7ab254b061 |
13 | 75b258c2641a |
14 | 342411151653 |
15 | 18252475e96a |
hex | c24fffbea89 |
13353053055625 has 10 divisors (see below), whose sum is σ = 16685975099090. Its totient is φ = 10682442444000.
The previous prime is 13353053055623. The next prime is 13353053055631. The reversal of 13353053055625 is 52655035035331.
It can be written as a sum of positive squares in 5 ways, for example, as 1900493845056 + 11452559210569 = 1378584^2 + 3384163^2 .
It is not a de Polignac number, because 13353053055625 - 21 = 13353053055623 is a prime.
It is a super-2 number, since 2×133530530556252 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13353053055623) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10682441820 + ... + 10682443069.
It is an arithmetic number, because the mean of its divisors is an integer number (1668597509909).
Almost surely, 213353053055625 is an apocalyptic number.
It is an amenable number.
13353053055625 is a deficient number, since it is larger than the sum of its proper divisors (3332922043465).
13353053055625 is an frugal number, since it uses more digits than its factorization.
13353053055625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21364884909 (or 21364884894 counting only the distinct ones).
The product of its (nonzero) digits is 3037500, while the sum is 46.
The spelling of 13353053055625 in words is "thirteen trillion, three hundred fifty-three billion, fifty-three million, fifty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •