Base | Representation |
---|---|
bin | 1100001100010011000101… |
… | …1011100101010010111011 |
3 | 1202110112201220222111011002 |
4 | 3003010301123211102323 |
5 | 3224113301043320201 |
6 | 44302211014155215 |
7 | 2552336601001124 |
oct | 303046133452273 |
9 | 52415656874132 |
10 | 13405422245051 |
11 | 42a9231419051 |
12 | 1606088952b0b |
13 | 763183784b85 |
14 | 344b7c3a104b |
15 | 183a8c0e176b |
hex | c31316e54bb |
13405422245051 has 16 divisors (see below), whose sum is σ = 14019125912064. Its totient is φ = 12794293748544.
The previous prime is 13405422245023. The next prime is 13405422245063. The reversal of 13405422245051 is 15054222450431.
13405422245051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13405422245051 - 26 = 13405422244987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13405422244996 and 13405422245014.
It is not an unprimeable number, because it can be changed into a prime (13405422244051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224317391 + ... + 224377143.
It is an arithmetic number, because the mean of its divisors is an integer number (876195369504).
Almost surely, 213405422245051 is an apocalyptic number.
13405422245051 is a deficient number, since it is larger than the sum of its proper divisors (613703667013).
13405422245051 is a wasteful number, since it uses less digits than its factorization.
13405422245051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81130.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 13405422245051 its reverse (15054222450431), we get a palindrome (28459644695482).
The spelling of 13405422245051 in words is "thirteen trillion, four hundred five billion, four hundred twenty-two million, two hundred forty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •