Base | Representation |
---|---|
bin | 1001011001011010100001… |
… | …1011011100010111001110 |
3 | 1100120202021022202020020121 |
4 | 2112112220123130113032 |
5 | 2323240342330110410 |
6 | 33550320213535154 |
7 | 2114323044615013 |
oct | 226265033342716 |
9 | 40522238666217 |
10 | 10332222113230 |
11 | 3323964027966 |
12 | 11aa5543444ba |
13 | 59c42a823b04 |
14 | 27a12187170a |
15 | 12db713649da |
hex | 965a86dc5ce |
10332222113230 has 8 divisors (see below), whose sum is σ = 18597999803832. Its totient is φ = 4132888845288.
The previous prime is 10332222113221. The next prime is 10332222113251. The reversal of 10332222113230 is 3231122223301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10332222113195 and 10332222113204.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 516611105652 + ... + 516611105671.
It is an arithmetic number, because the mean of its divisors is an integer number (2324749975479).
Almost surely, 210332222113230 is an apocalyptic number.
10332222113230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10332222113230 is a deficient number, since it is larger than the sum of its proper divisors (8265777690602).
10332222113230 is a wasteful number, since it uses less digits than its factorization.
10332222113230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033222211330.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10332222113230 its reverse (3231122223301), we get a palindrome (13563344336531).
The spelling of 10332222113230 in words is "ten trillion, three hundred thirty-two billion, two hundred twenty-two million, one hundred thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •