Base | Representation |
---|---|
bin | 10010011000101011010100… |
… | …11110001001010001010010 |
3 | 12022011002201001120220121112 |
4 | 21030111222132021101102 |
5 | 20244402240220210214 |
6 | 221553232442453322 |
7 | 11341664600006534 |
oct | 1114255236112122 |
9 | 168132631526545 |
10 | 40430313444434 |
11 | 11978443a17991 |
12 | 464b7ba204242 |
13 | 19737401c5274 |
14 | 9daba2599854 |
15 | 4a1a42a06a3e |
hex | 24c56a789452 |
40430313444434 has 4 divisors (see below), whose sum is σ = 60645470166654. Its totient is φ = 20215156722216.
The previous prime is 40430313444431. The next prime is 40430313444457. The reversal of 40430313444434 is 43444431303404.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 34109629719025 + 6320683725409 = 5840345^2 + 2514097^2 .
It is a super-2 number, since 2×404303134444342 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40430313444391 and 40430313444400.
It is not an unprimeable number, because it can be changed into a prime (40430313444431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10107578361107 + ... + 10107578361110.
Almost surely, 240430313444434 is an apocalyptic number.
40430313444434 is a deficient number, since it is larger than the sum of its proper divisors (20215156722220).
40430313444434 is a wasteful number, since it uses less digits than its factorization.
40430313444434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20215156722219.
The product of its (nonzero) digits is 1327104, while the sum is 41.
Adding to 40430313444434 its reverse (43444431303404), we get a palindrome (83874744747838).
The spelling of 40430313444434 in words is "forty trillion, four hundred thirty billion, three hundred thirteen million, four hundred forty-four thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •