Base | Representation |
---|---|
bin | 1001011000110010011000… |
… | …0000010100011111101001 |
3 | 1100112201110011212220012011 |
4 | 2112030212000110133221 |
5 | 2323101304132433231 |
6 | 33541334514115521 |
7 | 2113462001462065 |
oct | 226144600243751 |
9 | 40481404786164 |
10 | 10321444030441 |
11 | 331a333091825 |
12 | 11a844687bba1 |
13 | 59b40088872b |
14 | 2797bc24aaa5 |
15 | 12d74000d9b1 |
hex | 963260147e9 |
10321444030441 has 16 divisors (see below), whose sum is σ = 10895664208000. Its totient is φ = 9750331438848.
The previous prime is 10321444030367. The next prime is 10321444030463. The reversal of 10321444030441 is 14403044412301.
It is a cyclic number.
It is not a de Polignac number, because 10321444030441 - 211 = 10321444028393 is a prime.
It is a super-4 number, since 4×103214440304414 (a number of 53 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (10321444034441) 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, 42450385 + ... + 42692833.
It is an arithmetic number, because the mean of its divisors is an integer number (680979013000).
Almost surely, 210321444030441 is an apocalyptic number.
It is an amenable number.
10321444030441 is a deficient number, since it is larger than the sum of its proper divisors (574220177559).
10321444030441 is a wasteful number, since it uses less digits than its factorization.
10321444030441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248848.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 10321444030441 its reverse (14403044412301), we get a palindrome (24724488442742).
The spelling of 10321444030441 in words is "ten trillion, three hundred twenty-one billion, four hundred forty-four million, thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •