Base | Representation |
---|---|
bin | 1011110101110111011001… |
… | …0101000101011100110010 |
3 | 1201002200222100120111112221 |
4 | 2331131312111011130302 |
5 | 3201310010431104020 |
6 | 43405153020511254 |
7 | 2512444336300645 |
oct | 275356625053462 |
9 | 51080870514487 |
10 | 13020031113010 |
11 | 416a84514a449 |
12 | 15634520ab52a |
13 | 735a259377cc |
14 | 33025c4c9a5c |
15 | 178a32eeb6aa |
hex | bd776545732 |
13020031113010 has 8 divisors (see below), whose sum is σ = 23436056003436. Its totient is φ = 5208012445200.
The previous prime is 13020031113007. The next prime is 13020031113013. The reversal of 13020031113010 is 1031113002031.
It is an interprime number because it is at equal distance from previous prime (13020031113007) and next prime (13020031113013).
It can be written as a sum of positive squares in 2 ways, for example, as 12992701402521 + 27329710489 = 3604539^2 + 165317^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (13020031113013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 651001555641 + ... + 651001555660.
Almost surely, 213020031113010 is an apocalyptic number.
13020031113010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13020031113010 is a deficient number, since it is larger than the sum of its proper divisors (10416024890426).
13020031113010 is a wasteful number, since it uses less digits than its factorization.
13020031113010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1302003111308.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 13020031113010 its reverse (1031113002031), we get a palindrome (14051144115041).
The spelling of 13020031113010 in words is "thirteen trillion, twenty billion, thirty-one million, one hundred thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •