Base | Representation |
---|---|
bin | 1001011000111001011001… |
… | …1010111010100111101101 |
3 | 1100112220022121202122101110 |
4 | 2112032112122322213231 |
5 | 2323114134443104131 |
6 | 33542250010102233 |
7 | 2113556512415004 |
oct | 226162632724755 |
9 | 40486277678343 |
10 | 10323330050541 |
11 | 3320110759622 |
12 | 11a889241a979 |
13 | 59b641536061 |
14 | 27991a915c3b |
15 | 12d8008a9646 |
hex | 963966ba9ed |
10323330050541 has 16 divisors (see below), whose sum is σ = 13770111225024. Its totient is φ = 6879384754944.
The previous prime is 10323330050533. The next prime is 10323330050557. The reversal of 10323330050541 is 14505003332301.
It is not a de Polignac number, because 10323330050541 - 23 = 10323330050533 is a prime.
It is a super-2 number, since 2×103233300505412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10323330050499 and 10323330050508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10323330050041) 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, 226599621 + ... + 226645173.
It is an arithmetic number, because the mean of its divisors is an integer number (860631951564).
Almost surely, 210323330050541 is an apocalyptic number.
It is an amenable number.
10323330050541 is a deficient number, since it is larger than the sum of its proper divisors (3446781174483).
10323330050541 is a wasteful number, since it uses less digits than its factorization.
10323330050541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75020.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 10323330050541 its reverse (14505003332301), we get a palindrome (24828333382842).
The spelling of 10323330050541 in words is "ten trillion, three hundred twenty-three billion, three hundred thirty million, fifty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •