Base | Representation |
---|---|
bin | 1011111000001110010110… |
… | …0001000001110010110011 |
3 | 1201020120120021022020021012 |
4 | 2332003211201001302303 |
5 | 3202441002103023103 |
6 | 43435533455221135 |
7 | 2515410430442561 |
oct | 276034541016263 |
9 | 51216507266235 |
10 | 13060551220403 |
11 | 4185a48748905 |
12 | 156b2802177ab |
13 | 7397b269240b |
14 | 3321c3ba4a31 |
15 | 179b054be2d8 |
hex | be0e5841cb3 |
13060551220403 has 8 divisors (see below), whose sum is σ = 13633273847328. Its totient is φ = 12488234641344.
The previous prime is 13060551220397. The next prime is 13060551220411. The reversal of 13060551220403 is 30402215506031.
It is a happy number.
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 13060551220403 - 228 = 13060282784947 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13060551220403.
It is not an unprimeable number, because it can be changed into a prime (13060551220463) 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, 101446226 + ... + 101574887.
It is an arithmetic number, because the mean of its divisors is an integer number (1704159230916).
Almost surely, 213060551220403 is an apocalyptic number.
13060551220403 is a deficient number, since it is larger than the sum of its proper divisors (572722626925).
13060551220403 is a wasteful number, since it uses less digits than its factorization.
13060551220403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203023933.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 13060551220403 its reverse (30402215506031), we get a palindrome (43462766726434).
The spelling of 13060551220403 in words is "thirteen trillion, sixty billion, five hundred fifty-one million, two hundred twenty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •