Base | Representation |
---|---|
bin | 1001001101101010000000… |
… | …1011110001000110010111 |
3 | 1022212102212110202002002120 |
4 | 2103122200023301012113 |
5 | 2311433142400320343 |
6 | 33313431534311023 |
7 | 2063612206002360 |
oct | 223324013610627 |
9 | 38772773662076 |
10 | 10130220323223 |
11 | 3256225307260 |
12 | 117737a358473 |
13 | 586377881910 |
14 | 27043b98ab67 |
15 | 12879c2c7683 |
hex | 936a02f1197 |
10130220323223 has 64 divisors (see below), whose sum is σ = 18136946860032. Its totient is φ = 4857185450880.
The previous prime is 10130220323177. The next prime is 10130220323231. The reversal of 10130220323223 is 32232302203101.
It is not a de Polignac number, because 10130220323223 - 228 = 10129951887767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10130220323193 and 10130220323202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130220321223) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 32478390 + ... + 32788812.
It is an arithmetic number, because the mean of its divisors is an integer number (283389794688).
Almost surely, 210130220323223 is an apocalyptic number.
10130220323223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10130220323223 is a deficient number, since it is larger than the sum of its proper divisors (8006726536809).
10130220323223 is a wasteful number, since it uses less digits than its factorization.
10130220323223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321324.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 10130220323223 its reverse (32232302203101), we get a palindrome (42362522526324).
The spelling of 10130220323223 in words is "ten trillion, one hundred thirty billion, two hundred twenty million, three hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •