Base | Representation |
---|---|
bin | 1001010010011111101000… |
… | …0110101000000000010001 |
3 | 1100011101101202110220222102 |
4 | 2110213322012220000101 |
5 | 2314313401311201223 |
6 | 33415535054050145 |
7 | 2102613630452600 |
oct | 224477206500021 |
9 | 40141352426872 |
10 | 10213333303313 |
11 | 32884a5430358 |
12 | 118b4b47a9955 |
13 | 59116190788a |
14 | 274483d3ba37 |
15 | 12aa13c05928 |
hex | 949fa1a8011 |
10213333303313 has 12 divisors (see below), whose sum is σ = 12264068431872. Its totient is φ = 8471889374760.
The previous prime is 10213333303309. The next prime is 10213333303339. The reversal of 10213333303313 is 31330333331201.
It is a happy number.
It is not a de Polignac number, because 10213333303313 - 22 = 10213333303309 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10213333303373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3361859345 + ... + 3361862382.
It is an arithmetic number, because the mean of its divisors is an integer number (1022005702656).
Almost surely, 210213333303313 is an apocalyptic number.
It is an amenable number.
10213333303313 is a deficient number, since it is larger than the sum of its proper divisors (2050735128559).
10213333303313 is an equidigital number, since it uses as much as digits as its factorization.
10213333303313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6723721772 (or 6723721765 counting only the distinct ones).
The product of its (nonzero) digits is 13122, while the sum is 29.
Adding to 10213333303313 its reverse (31330333331201), we get a palindrome (41543666634514).
The spelling of 10213333303313 in words is "ten trillion, two hundred thirteen billion, three hundred thirty-three million, three hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •