Base | Representation |
---|---|
bin | 1001011010000010110000… |
… | …1011011011001111100001 |
3 | 1100121210011000110202021120 |
4 | 2112200230023123033201 |
5 | 2323430002221111231 |
6 | 33555304030242453 |
7 | 2115154511111244 |
oct | 226405413331741 |
9 | 40553130422246 |
10 | 10343022441441 |
11 | 33284a6587348 |
12 | 11b0669356429 |
13 | 5a045c27a671 |
14 | 27a86800725b |
15 | 12e0a4611d96 |
hex | 9682c2db3e1 |
10343022441441 has 16 divisors (see below), whose sum is σ = 13833414366144. Its totient is φ = 6874009458624.
The previous prime is 10343022441421. The next prime is 10343022441449. The reversal of 10343022441441 is 14414422034301.
It is a happy number.
It is not a de Polignac number, because 10343022441441 - 26 = 10343022441377 is a prime.
It is a super-2 number, since 2×103430224414412 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10343022441449) 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, 441571 + ... + 4569576.
It is an arithmetic number, because the mean of its divisors is an integer number (864588397884).
Almost surely, 210343022441441 is an apocalyptic number.
It is an amenable number.
10343022441441 is a deficient number, since it is larger than the sum of its proper divisors (3490391924703).
10343022441441 is a wasteful number, since it uses less digits than its factorization.
10343022441441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5013280.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 10343022441441 its reverse (14414422034301), we get a palindrome (24757444475742).
It can be divided in two parts, 1034302 and 2441441, that added together give a palindrome (3475743).
The spelling of 10343022441441 in words is "ten trillion, three hundred forty-three billion, twenty-two million, four hundred forty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •