Base | Representation |
---|---|
bin | 1100000100100000000001… |
… | …0011100001000011010010 |
3 | 1201222201221110012121000111 |
4 | 3001020000103201003102 |
5 | 3214414414214421004 |
6 | 44120453303111534 |
7 | 2536555001140261 |
oct | 301100023410322 |
9 | 51881843177014 |
10 | 13271454060754 |
11 | 425743491636a |
12 | 15a411b1425aa |
13 | 75365374b1c6 |
14 | 33c4adca45d8 |
15 | 18034abdea04 |
hex | c12004e10d2 |
13271454060754 has 8 divisors (see below), whose sum is σ = 19908371121660. Its totient is φ = 6635330353536.
The previous prime is 13271454060713. The next prime is 13271454060763. The reversal of 13271454060754 is 45706045417231.
It can be written as a sum of positive squares in 2 ways, for example, as 13271252278729 + 201782025 = 3642973^2 + 14205^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×132714540607542 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13271454060698 and 13271454060707.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 198296599 + ... + 198363514.
Almost surely, 213271454060754 is an apocalyptic number.
13271454060754 is a deficient number, since it is larger than the sum of its proper divisors (6636917060906).
13271454060754 is a wasteful number, since it uses less digits than its factorization.
13271454060754 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396676844.
The product of its (nonzero) digits is 2822400, while the sum is 49.
Adding to 13271454060754 its reverse (45706045417231), we get a palindrome (58977499477985).
The spelling of 13271454060754 in words is "thirteen trillion, two hundred seventy-one billion, four hundred fifty-four million, sixty thousand, seven hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •