Base | Representation |
---|---|
bin | 1001011010000000100100… |
… | …0010111101110100110010 |
3 | 1100121201121221101002202112 |
4 | 2112200021002331310302 |
5 | 2323422300323134414 |
6 | 33555125333045322 |
7 | 2115134063115056 |
oct | 226401102756462 |
9 | 40551557332675 |
10 | 10342433021234 |
11 | 33282238a5206 |
12 | 11b0523a86842 |
13 | 5a0397117502 |
14 | 27a80da15c66 |
15 | 12e06c9d3d3e |
hex | 968090bdd32 |
10342433021234 has 32 divisors (see below), whose sum is σ = 15641802967680. Its totient is φ = 5128631659008.
The previous prime is 10342433021233. The next prime is 10342433021257. The reversal of 10342433021234 is 43212033424301.
It is a super-2 number, since 2×103424330212342 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10342433021234.
It is not an unprimeable number, because it can be changed into a prime (10342433021233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 381246179 + ... + 381273305.
It is an arithmetic number, because the mean of its divisors is an integer number (488806342740).
Almost surely, 210342433021234 is an apocalyptic number.
10342433021234 is a deficient number, since it is larger than the sum of its proper divisors (5299369946446).
10342433021234 is a wasteful number, since it uses less digits than its factorization.
10342433021234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29522.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 10342433021234 its reverse (43212033424301), we get a palindrome (53554466445535).
The spelling of 10342433021234 in words is "ten trillion, three hundred forty-two billion, four hundred thirty-three million, twenty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •