Base | Representation |
---|---|
bin | 1011111101100111111010… |
… | …0111000010110001000000 |
3 | 1201120110000001212221010122 |
4 | 2333121332213002301000 |
5 | 3211000441342241022 |
6 | 43550314332115412 |
7 | 2525203245325604 |
oct | 277317647026100 |
9 | 51513001787118 |
10 | 13153314024512 |
11 | 421131a951582 |
12 | 158524a305b68 |
13 | 7454769ba50c |
14 | 3368a39a3504 |
15 | 17c234189742 |
hex | bf67e9c2c40 |
13153314024512 has 14 divisors (see below), whose sum is σ = 26101107517518. Its totient is φ = 6576657012224.
The previous prime is 13153314024469. The next prime is 13153314024517. The reversal of 13153314024512 is 21542041335131.
It can be written as a sum of positive squares in only one way, i.e., 12177754832896 + 975559191616 = 3489664^2 + 987704^2 .
It is a super-2 number, since 2×131533140245122 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13153314024517) by changing a digit.
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 as a sum of consecutive naturals, namely, 102760265753 + ... + 102760265880.
Almost surely, 213153314024512 is an apocalyptic number.
It is an amenable number.
13153314024512 is a deficient number, since it is larger than the sum of its proper divisors (12947793493006).
13153314024512 is an equidigital number, since it uses as much as digits as its factorization.
13153314024512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205520531645 (or 205520531635 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 13153314024512 its reverse (21542041335131), we get a palindrome (34695355359643).
The spelling of 13153314024512 in words is "thirteen trillion, one hundred fifty-three billion, three hundred fourteen million, twenty-four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •