Base | Representation |
---|---|
bin | 1011111011111000001100… |
… | …0001100001000001110011 |
3 | 1201110120120222001101002022 |
4 | 2332332003001201001303 |
5 | 3210003031231131003 |
6 | 43524434350542055 |
7 | 2523062120360045 |
oct | 276760301410163 |
9 | 51416528041068 |
10 | 13123323302003 |
11 | 41aa62a9748a2 |
12 | 157b47a50792b |
13 | 7426a7523175 |
14 | 33525a891a95 |
15 | 17b57b294738 |
hex | bef83061073 |
13123323302003 has 4 divisors (see below), whose sum is σ = 13138118481360. Its totient is φ = 13108528122648.
The previous prime is 13123323301973. The next prime is 13123323302017. The reversal of 13123323302003 is 30020332332131.
It is a happy number.
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 13123323302003 - 218 = 13123323039859 is a prime.
It is a super-2 number, since 2×131233233020032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13123323301003) 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, 7397588348 + ... + 7397590121.
It is an arithmetic number, because the mean of its divisors is an integer number (3284529620340).
Almost surely, 213123323302003 is an apocalyptic number.
13123323302003 is a deficient number, since it is larger than the sum of its proper divisors (14795179357).
13123323302003 is an equidigital number, since it uses as much as digits as its factorization.
13123323302003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14795179356.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 13123323302003 its reverse (30020332332131), we get a palindrome (43143655634134).
The spelling of 13123323302003 in words is "thirteen trillion, one hundred twenty-three billion, three hundred twenty-three million, three hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •