Base | Representation |
---|---|
bin | 101101100011001111001… |
… | …111010110111010100111 |
3 | 102002020121221012011222211 |
4 | 231203033033112322213 |
5 | 402241134023214343 |
6 | 10354000002104251 |
7 | 442102412232565 |
oct | 55431717267247 |
9 | 12066557164884 |
10 | 3130213101223 |
11 | aa7574766a1a |
12 | 4267a604b087 |
13 | 1992408c8020 |
14 | ab7087d4a35 |
15 | 5665614d79d |
hex | 2d8cf3d6ea7 |
3130213101223 has 16 divisors (see below), whose sum is σ = 3404615368896. Its totient is φ = 2860617254400.
The previous prime is 3130213101209. The next prime is 3130213101227. The reversal of 3130213101223 is 3221013120313.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3130213101223 is a prime.
It is a super-2 number, since 2×31302131012232 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3130213101194 and 3130213101203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3130213101227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20415615 + ... + 20568367.
It is an arithmetic number, because the mean of its divisors is an integer number (212788460556).
Almost surely, 23130213101223 is an apocalyptic number.
3130213101223 is a deficient number, since it is larger than the sum of its proper divisors (274402267673).
3130213101223 is a wasteful number, since it uses less digits than its factorization.
3130213101223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168474.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3130213101223 its reverse (3221013120313), we get a palindrome (6351226221536).
The spelling of 3130213101223 in words is "three trillion, one hundred thirty billion, two hundred thirteen million, one hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •