Base | Representation |
---|---|
bin | 111101010101101000111… |
… | …110110111111111110011 |
3 | 112220221222020212212211002 |
4 | 331111220332313333303 |
5 | 1023030033300331011 |
6 | 12544222404512215 |
7 | 613350464536403 |
oct | 75255076677763 |
9 | 15827866785732 |
10 | 4215124230131 |
11 | 1385695815811 |
12 | 580b046ab66b |
13 | 24763b60c0b9 |
14 | 108027d42803 |
15 | 749a20d2c3b |
hex | 3d568fb7ff3 |
4215124230131 has 2 divisors, whose sum is σ = 4215124230132. Its totient is φ = 4215124230130.
The previous prime is 4215124230101. The next prime is 4215124230133. The reversal of 4215124230131 is 1310324215124.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4215124230131 - 222 = 4215120035827 is a prime.
It is a super-2 number, since 2×42151242301312 (a number of 26 digits) contains 22 as substring.
Together with 4215124230133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4215124230094 and 4215124230103.
It is not a weakly prime, because it can be changed into another prime (4215124230133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2107562115065 + 2107562115066.
It is an arithmetic number, because the mean of its divisors is an integer number (2107562115066).
Almost surely, 24215124230131 is an apocalyptic number.
4215124230131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4215124230131 is an equidigital number, since it uses as much as digits as its factorization.
4215124230131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 4215124230131 its reverse (1310324215124), we get a palindrome (5525448445255).
The spelling of 4215124230131 in words is "four trillion, two hundred fifteen billion, one hundred twenty-four million, two hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •