Base | Representation |
---|---|
bin | 111110100100110011001… |
… | …100010100110101111101 |
3 | 120020002100211112220002221 |
4 | 332210303030110311331 |
5 | 1030423122002214123 |
6 | 13051240503245341 |
7 | 622450003354261 |
oct | 76446314246575 |
9 | 16202324486087 |
10 | 4300121132413 |
11 | 14087423034a7 |
12 | 595485a49851 |
13 | 252665a59812 |
14 | 10c1ac5b40a1 |
15 | 76cc90e525d |
hex | 3e933314d7d |
4300121132413 has 2 divisors, whose sum is σ = 4300121132414. Its totient is φ = 4300121132412.
The previous prime is 4300121132407. The next prime is 4300121132423. The reversal of 4300121132413 is 3142311210034.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2668132767364 + 1631988365049 = 1633442^2 + 1277493^2 .
It is a cyclic number.
It is not a de Polignac number, because 4300121132413 - 25 = 4300121132381 is a prime.
It is a super-2 number, since 2×43001211324132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4300121132423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2150060566206 + 2150060566207.
It is an arithmetic number, because the mean of its divisors is an integer number (2150060566207).
Almost surely, 24300121132413 is an apocalyptic number.
It is an amenable number.
4300121132413 is a deficient number, since it is larger than the sum of its proper divisors (1).
4300121132413 is an equidigital number, since it uses as much as digits as its factorization.
4300121132413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 4300121132413 its reverse (3142311210034), we get a palindrome (7442432342447).
The spelling of 4300121132413 in words is "four trillion, three hundred billion, one hundred twenty-one million, one hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •