Base | Representation |
---|---|
bin | 1100000110101111101010… |
… | …0011100111000011100111 |
3 | 1202010102110122101012210012 |
4 | 3001223322203213003213 |
5 | 3221032401123301043 |
6 | 44150311340320435 |
7 | 2542421341016204 |
oct | 301537243470347 |
9 | 52112418335705 |
10 | 13310012322023 |
11 | 4271820a6779a |
12 | 15ab6a024311b |
13 | 757189bc9c11 |
14 | 3402cabb6cab |
15 | 181355d39a18 |
hex | c1afa8e70e7 |
13310012322023 has 4 divisors (see below), whose sum is σ = 14010539286360. Its totient is φ = 12609485357688.
The previous prime is 13310012321839. The next prime is 13310012322053. The reversal of 13310012322023 is 32022321001331.
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 13310012322023 - 210 = 13310012320999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13310012322023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310012322053) 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, 350263482140 + ... + 350263482177.
It is an arithmetic number, because the mean of its divisors is an integer number (3502634821590).
Almost surely, 213310012322023 is an apocalyptic number.
13310012322023 is a deficient number, since it is larger than the sum of its proper divisors (700526964337).
13310012322023 is an equidigital number, since it uses as much as digits as its factorization.
13310012322023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 700526964336.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13310012322023 its reverse (32022321001331), we get a palindrome (45332333323354).
The spelling of 13310012322023 in words is "thirteen trillion, three hundred ten billion, twelve million, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •