Base | Representation |
---|---|
bin | 1001010111100011001111… |
… | …0101110010010000101011 |
3 | 1100110200121201222001112111 |
4 | 2111320303311302100223 |
5 | 2322224303014011243 |
6 | 33523502553023151 |
7 | 2112110406404155 |
oct | 225706365622053 |
9 | 40420551861474 |
10 | 10300201313323 |
11 | 331132212aa69 |
12 | 11a42b86b4ab7 |
13 | 5993c68b112c |
14 | 278764cb5ad5 |
15 | 12cdea11a39d |
hex | 95e33d7242b |
10300201313323 has 16 divisors (see below), whose sum is σ = 10662883446784. Its totient is φ = 9941970780000.
The previous prime is 10300201313293. The next prime is 10300201313327. The reversal of 10300201313323 is 32331310200301.
It is a cyclic number.
It is not a de Polignac number, because 10300201313323 - 217 = 10300201182251 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10300201313294 and 10300201313303.
It is not an unprimeable number, because it can be changed into a prime (10300201313327) 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 15 ways as a sum of consecutive naturals, for example, 52771036 + ... + 52965862.
It is an arithmetic number, because the mean of its divisors is an integer number (666430215424).
Almost surely, 210300201313323 is an apocalyptic number.
10300201313323 is a deficient number, since it is larger than the sum of its proper divisors (362682133461).
10300201313323 is a wasteful number, since it uses less digits than its factorization.
10300201313323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206242.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 10300201313323 its reverse (32331310200301), we get a palindrome (42631511513624).
The spelling of 10300201313323 in words is "ten trillion, three hundred billion, two hundred one million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •