Base | Representation |
---|---|
bin | 1001011111001010111111… |
… | …0011111100011100110001 |
3 | 1100221012120101210212122111 |
4 | 2113302233303330130301 |
5 | 2331400423314140213 |
6 | 34103554534005321 |
7 | 2124424062652162 |
oct | 227625763743461 |
9 | 40835511725574 |
10 | 10431130224433 |
11 | 33618aa088826 |
12 | 12057584a6841 |
13 | 5a88610627b9 |
14 | 280c258a5769 |
15 | 13150e7bba3d |
hex | 97cafcfc731 |
10431130224433 has 2 divisors, whose sum is σ = 10431130224434. Its totient is φ = 10431130224432.
The previous prime is 10431130224421. The next prime is 10431130224479. The reversal of 10431130224433 is 33442203113401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10353059158689 + 78071065744 = 3217617^2 + 279412^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10431130224433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10431130224395 and 10431130224404.
It is not a weakly prime, because it can be changed into another prime (10431130222433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5215565112216 + 5215565112217.
It is an arithmetic number, because the mean of its divisors is an integer number (5215565112217).
Almost surely, 210431130224433 is an apocalyptic number.
It is an amenable number.
10431130224433 is a deficient number, since it is larger than the sum of its proper divisors (1).
10431130224433 is an equidigital number, since it uses as much as digits as its factorization.
10431130224433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 10431130224433 its reverse (33442203113401), we get a palindrome (43873333337834).
The spelling of 10431130224433 in words is "ten trillion, four hundred thirty-one billion, one hundred thirty million, two hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •