Base | Representation |
---|---|
bin | 1001011000010100000010… |
… | …1001100111101111101111 |
3 | 1100111221102200120201001012 |
4 | 2112011000221213233233 |
5 | 2322433120042131343 |
6 | 33533510511335435 |
7 | 2113053134122160 |
oct | 226050051475757 |
9 | 40457380521035 |
10 | 10313301130223 |
11 | 3316934691323 |
12 | 11a695382157b |
13 | 59a703861190 |
14 | 2792489c5767 |
15 | 12d4151d7718 |
hex | 96140a67bef |
10313301130223 has 16 divisors (see below), whose sum is σ = 13102754789376. Its totient is φ = 7896749533920.
The previous prime is 10313301130201. The next prime is 10313301130229. The reversal of 10313301130223 is 32203110331301.
It is not a de Polignac number, because 10313301130223 - 210 = 10313301129199 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10313301130229) 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, 1827948461 + ... + 1827954102.
It is an arithmetic number, because the mean of its divisors is an integer number (818922174336).
Almost surely, 210313301130223 is an apocalyptic number.
10313301130223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10313301130223 is a deficient number, since it is larger than the sum of its proper divisors (2789453659153).
10313301130223 is a wasteful number, since it uses less digits than its factorization.
10313301130223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3655902614.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 10313301130223 its reverse (32203110331301), we get a palindrome (42516411461524).
The spelling of 10313301130223 in words is "ten trillion, three hundred thirteen billion, three hundred one million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •