Base | Representation |
---|---|
bin | 10010001111011110111101… |
… | …00101101100110100111001 |
3 | 12021000220100212200122021111 |
4 | 21013233132211230310321 |
5 | 20224213330101032413 |
6 | 221152152214040321 |
7 | 11310113033030263 |
oct | 1107573645546471 |
9 | 167026325618244 |
10 | 40114434002233 |
11 | 11866488238738 |
12 | 45ba5429490a1 |
13 | 194ca0c5a1216 |
14 | 9c9798508b33 |
15 | 498706217d3d |
hex | 247bde96cd39 |
40114434002233 has 2 divisors, whose sum is σ = 40114434002234. Its totient is φ = 40114434002232.
The previous prime is 40114434002143. The next prime is 40114434002281. The reversal of 40114434002233 is 33220043441104.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32323011320889 + 7791422681344 = 5685333^2 + 2791312^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40114434002233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40114434002195 and 40114434002204.
It is not a weakly prime, because it can be changed into another prime (40114434002333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20057217001116 + 20057217001117.
It is an arithmetic number, because the mean of its divisors is an integer number (20057217001117).
Almost surely, 240114434002233 is an apocalyptic number.
It is an amenable number.
40114434002233 is a deficient number, since it is larger than the sum of its proper divisors (1).
40114434002233 is an equidigital number, since it uses as much as digits as its factorization.
40114434002233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 40114434002233 its reverse (33220043441104), we get a palindrome (73334477443337).
The spelling of 40114434002233 in words is "forty trillion, one hundred fourteen billion, four hundred thirty-four million, two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •