Base | Representation |
---|---|
bin | 1011110101110111101111… |
… | …0100111100011111111011 |
3 | 1201002201012210010200100002 |
4 | 2331131323310330133323 |
5 | 3201310203034213120 |
6 | 43405210113503215 |
7 | 2512446536304323 |
oct | 275357364743773 |
9 | 51081183120302 |
10 | 13020123351035 |
11 | 416a89221a219 |
12 | 1563478b71b0b |
13 | 735a3ba91318 |
14 | 33026a85a283 |
15 | 178a3b16b375 |
hex | bd77bd3c7fb |
13020123351035 has 4 divisors (see below), whose sum is σ = 15624148021248. Its totient is φ = 10416098680824.
The previous prime is 13020123350987. The next prime is 13020123351049. The reversal of 13020123351035 is 53015332102031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13020123351035 - 220 = 13020122302459 is a prime.
It is a super-2 number, since 2×130201233510352 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13020123350989 and 13020123351007.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1302012335099 + ... + 1302012335108.
It is an arithmetic number, because the mean of its divisors is an integer number (3906037005312).
Almost surely, 213020123351035 is an apocalyptic number.
13020123351035 is a deficient number, since it is larger than the sum of its proper divisors (2604024670213).
13020123351035 is an equidigital number, since it uses as much as digits as its factorization.
13020123351035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2604024670212.
The product of its (nonzero) digits is 8100, while the sum is 29.
Adding to 13020123351035 its reverse (53015332102031), we get a palindrome (66035455453066).
The spelling of 13020123351035 in words is "thirteen trillion, twenty billion, one hundred twenty-three million, three hundred fifty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •