Base | Representation |
---|---|
bin | 1001001101001100101000… |
… | …0000001111101011100001 |
3 | 1022211200111201111022100020 |
4 | 2103103022000033223201 |
5 | 2311321013443324413 |
6 | 33310045104344053 |
7 | 2063212552314261 |
oct | 223231200175341 |
9 | 38750451438306 |
10 | 10122332011233 |
11 | 3252947593752 |
12 | 1175938615029 |
13 | 5856bb5152a0 |
14 | 26dcd00777a1 |
15 | 1284899dec23 |
hex | 934ca00fae1 |
10122332011233 has 16 divisors (see below), whose sum is σ = 14540027920320. Its totient is φ = 6226814245824.
The previous prime is 10122332011217. The next prime is 10122332011241. The reversal of 10122332011233 is 33211023322101.
It is not a de Polignac number, because 10122332011233 - 24 = 10122332011217 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10122332011933) 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, 48084163 + ... + 48294216.
It is an arithmetic number, because the mean of its divisors is an integer number (908751745020).
Almost surely, 210122332011233 is an apocalyptic number.
10122332011233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10122332011233 is a deficient number, since it is larger than the sum of its proper divisors (4417695909087).
10122332011233 is a wasteful number, since it uses less digits than its factorization.
10122332011233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96381088.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 10122332011233 its reverse (33211023322101), we get a palindrome (43333355333334).
The spelling of 10122332011233 in words is "ten trillion, one hundred twenty-two billion, three hundred thirty-two million, eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •