Base | Representation |
---|---|
bin | 1011111100011101010111… |
… | …0000101011010001000010 |
3 | 1201111112100100110202200012 |
4 | 2333013111300223101002 |
5 | 3210134000120043020 |
6 | 43533204430424522 |
7 | 2523564310253450 |
oct | 277072560532102 |
9 | 51445310422605 |
10 | 13133301331010 |
11 | 4203890242763 |
12 | 15813a4062142 |
13 | 7436077ba043 |
14 | 335925b359d0 |
15 | 17b9622627c5 |
hex | bf1d5c2b442 |
13133301331010 has 64 divisors (see below), whose sum is σ = 27949431870720. Its totient is φ = 4347461825280.
The previous prime is 13133301331009. The next prime is 13133301331043. The reversal of 13133301331010 is 1013310333131.
13133301331010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×131333013310102 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118165565 + ... + 118276655.
It is an arithmetic number, because the mean of its divisors is an integer number (436709872980).
Almost surely, 213133301331010 is an apocalyptic number.
13133301331010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13133301331010 is an abundant number, since it is smaller than the sum of its proper divisors (14816130539710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13133301331010 is a wasteful number, since it uses less digits than its factorization.
13133301331010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169371.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 13133301331010 its reverse (1013310333131), we get a palindrome (14146611664141).
The spelling of 13133301331010 in words is "thirteen trillion, one hundred thirty-three billion, three hundred one million, three hundred thirty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •