Base | Representation |
---|---|
bin | 100110101100111001110100… |
… | …1110110010110110010111001 |
3 | 1122122100010100100202020111122 |
4 | 1031121303221312112302321 |
5 | 324104442331443041213 |
6 | 3204004103115435025 |
7 | 131463516030561026 |
oct | 11531635166266271 |
9 | 1578303310666448 |
10 | 340423031221433 |
11 | 99518662350496 |
12 | 32220320455a75 |
13 | 117c49a59ab994 |
14 | 600c7c3bac54d |
15 | 29552b6d9ed08 |
hex | 1359ce9d96cb9 |
340423031221433 has 16 divisors (see below), whose sum is σ = 347788894373760. Its totient is φ = 333126867908736.
The previous prime is 340423031221367. The next prime is 340423031221447. The reversal of 340423031221433 is 334122130324043.
It is not a de Polignac number, because 340423031221433 - 230 = 340421957479609 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 340423031221393 and 340423031221402.
It is not an unprimeable number, because it can be changed into a prime (340423031221633) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8548535 + ... + 27457667.
It is an arithmetic number, because the mean of its divisors is an integer number (21736805898360).
Almost surely, 2340423031221433 is an apocalyptic number.
It is an amenable number.
340423031221433 is a deficient number, since it is larger than the sum of its proper divisors (7365863152327).
340423031221433 is a wasteful number, since it uses less digits than its factorization.
340423031221433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18910976.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 340423031221433 its reverse (334122130324043), we get a palindrome (674545161545476).
The spelling of 340423031221433 in words is "three hundred forty trillion, four hundred twenty-three billion, thirty-one million, two hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •