Base | Representation |
---|---|
bin | 1001011000110000110011… |
… | …0110111100001100111011 |
3 | 1100112200100210000201000022 |
4 | 2112030030312330030323 |
5 | 2323044423132004433 |
6 | 33541225003401055 |
7 | 2113445356462322 |
oct | 226141466741473 |
9 | 40480323021008 |
10 | 10321022141243 |
11 | 331a136a26170 |
12 | 11a834952318b |
13 | 59b364351b58 |
14 | 27977c1c90b9 |
15 | 12d717e74698 |
hex | 9630cdbc33b |
10321022141243 has 8 divisors (see below), whose sum is σ = 11262685214016. Its totient is φ = 9379923790600.
The previous prime is 10321022141219. The next prime is 10321022141249. The reversal of 10321022141243 is 34214122012301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10321022141243 - 218 = 10321021879099 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10321022141249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 141142313 + ... + 141215418.
It is an arithmetic number, because the mean of its divisors is an integer number (1407835651752).
Almost surely, 210321022141243 is an apocalyptic number.
10321022141243 is a deficient number, since it is larger than the sum of its proper divisors (941663072773).
10321022141243 is a wasteful number, since it uses less digits than its factorization.
10321022141243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282361065.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 10321022141243 its reverse (34214122012301), we get a palindrome (44535144153544).
The spelling of 10321022141243 in words is "ten trillion, three hundred twenty-one billion, twenty-two million, one hundred forty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •