Base | Representation |
---|---|
bin | 10111011011000001101100… |
… | …001001010010111001100011 |
3 | 111111201212210000000202122221 |
4 | 113123001230021102321203 |
5 | 102000223202330101144 |
6 | 1003031111340211511 |
7 | 30461252033534644 |
oct | 2733015411227143 |
9 | 444655700022587 |
10 | 103012310003299 |
11 | 2a9063035205a4 |
12 | b678586239b97 |
13 | 45630330cb668 |
14 | 1b61b729816cb |
15 | bd98beabbd84 |
hex | 5db06c252e63 |
103012310003299 has 8 divisors (see below), whose sum is σ = 104600503823360. Its totient is φ = 101431222196616.
The previous prime is 103012310003249. The next prime is 103012310003303. The reversal of 103012310003299 is 992300013210301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103012310003299 - 233 = 103003720068707 is a prime.
It is a super-2 number, since 2×1030123100032992 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103012310003219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1776474129 + ... + 1776532114.
It is an arithmetic number, because the mean of its divisors is an integer number (13075062977920).
Almost surely, 2103012310003299 is an apocalyptic number.
103012310003299 is a deficient number, since it is larger than the sum of its proper divisors (1588193820061).
103012310003299 is an equidigital number, since it uses as much as digits as its factorization.
103012310003299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3553006689.
The product of its (nonzero) digits is 8748, while the sum is 34.
The spelling of 103012310003299 in words is "one hundred three trillion, twelve billion, three hundred ten million, three thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •