Base | Representation |
---|---|
bin | 1100110000101111000011… |
… | …0011100010010011100001 |
3 | 1211200101111121122100102011 |
4 | 3030023300303202103201 |
5 | 3314342303211333213 |
6 | 45501534311152521 |
7 | 2645510152405201 |
oct | 314136063422341 |
9 | 54611447570364 |
10 | 14031403230433 |
11 | 451a759364496 |
12 | 16a7468675741 |
13 | 7aa203c58cc4 |
14 | 3671a2dca401 |
15 | 194ec7d0903d |
hex | cc2f0ce24e1 |
14031403230433 has 2 divisors, whose sum is σ = 14031403230434. Its totient is φ = 14031403230432.
The previous prime is 14031403230379. The next prime is 14031403230463. The reversal of 14031403230433 is 33403230413041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13828752002209 + 202651228224 = 3718703^2 + 450168^2 .
It is a cyclic number.
It is not a de Polignac number, because 14031403230433 - 213 = 14031403222241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14031403230395 and 14031403230404.
It is not a weakly prime, because it can be changed into another prime (14031403230463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7015701615216 + 7015701615217.
It is an arithmetic number, because the mean of its divisors is an integer number (7015701615217).
Almost surely, 214031403230433 is an apocalyptic number.
It is an amenable number.
14031403230433 is a deficient number, since it is larger than the sum of its proper divisors (1).
14031403230433 is an equidigital number, since it uses as much as digits as its factorization.
14031403230433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 14031403230433 its reverse (33403230413041), we get a palindrome (47434633643474).
The spelling of 14031403230433 in words is "fourteen trillion, thirty-one billion, four hundred three million, two hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •