Base | Representation |
---|---|
bin | 10011001001000110111… |
… | …111011010001100000011 |
3 | 11122202102001011121002110 |
4 | 103021012333122030003 |
5 | 133023020430120120 |
6 | 2444150532350403 |
7 | 164016050116125 |
oct | 23110677321403 |
9 | 4582361147073 |
10 | 1315451020035 |
11 | 467974897239 |
12 | 192b39a75403 |
13 | 9707b209549 |
14 | 4794d655215 |
15 | 2434062a2e0 |
hex | 13246fda303 |
1315451020035 has 16 divisors (see below), whose sum is σ = 2105060324256. Its totient is φ = 701460979968.
The previous prime is 1315451020033. The next prime is 1315451020043. The reversal of 1315451020035 is 5300201545131.
It is not a de Polignac number, because 1315451020035 - 21 = 1315451020033 is a prime.
It is a super-2 number, since 2×13154510200352 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1315451019984 and 1315451020011.
It is not an unprimeable number, because it can be changed into a prime (1315451020033) 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, 6959724 + ... + 7146233.
It is an arithmetic number, because the mean of its divisors is an integer number (131566270266).
Almost surely, 21315451020035 is an apocalyptic number.
1315451020035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1315451020035 is a deficient number, since it is larger than the sum of its proper divisors (789609304221).
1315451020035 is a wasteful number, since it uses less digits than its factorization.
1315451020035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14112182.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 1315451020035 its reverse (5300201545131), we get a palindrome (6615652565166).
The spelling of 1315451020035 in words is "one trillion, three hundred fifteen billion, four hundred fifty-one million, twenty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •