Base | Representation |
---|---|
bin | 1001011000111000010010… |
… | …1010011111010111101101 |
3 | 1100112212112212012101112110 |
4 | 2112032010222133113231 |
5 | 2323113032212041331 |
6 | 33542200244554233 |
7 | 2113546234302621 |
oct | 226160452372755 |
9 | 40485485171473 |
10 | 10323032143341 |
11 | 331aa78584525 |
12 | 11a880a6b2979 |
13 | 59b5c48bb9c8 |
14 | 2798cd129181 |
15 | 12d7d4660946 |
hex | 96384a9f5ed |
10323032143341 has 8 divisors (see below), whose sum is σ = 13764057700000. Its totient is φ = 6882014007792.
The previous prime is 10323032143327. The next prime is 10323032143367. The reversal of 10323032143341 is 14334123032301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10323032143341 - 25 = 10323032143309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10323032143299 and 10323032143308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10323032143381) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4525410 + ... + 6412908.
It is an arithmetic number, because the mean of its divisors is an integer number (1720507212500).
Almost surely, 210323032143341 is an apocalyptic number.
It is an amenable number.
10323032143341 is a deficient number, since it is larger than the sum of its proper divisors (3441025556659).
10323032143341 is a wasteful number, since it uses less digits than its factorization.
10323032143341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3710555.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 10323032143341 its reverse (14334123032301), we get a palindrome (24657155175642).
The spelling of 10323032143341 in words is "ten trillion, three hundred twenty-three billion, thirty-two million, one hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •