Base | Representation |
---|---|
bin | 10111000010011001100111… |
… | …111011101110000110110001 |
3 | 111021202002200120000012120020 |
4 | 113002121213323232012301 |
5 | 101240011401142034413 |
6 | 555253435312034053 |
7 | 30225062413660524 |
oct | 2702314773560661 |
9 | 437662616005506 |
10 | 101320022221233 |
11 | 2a313642155542 |
12 | b4445ba532929 |
13 | 446c58b3c846a |
14 | 1b03cb55c8bbb |
15 | baa87639ec23 |
hex | 5c2667eee1b1 |
101320022221233 has 8 divisors (see below), whose sum is σ = 135198167748000. Its totient is φ = 67494279087648.
The previous prime is 101320022221219. The next prime is 101320022221303. The reversal of 101320022221233 is 332122220023101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101320022221233 - 218 = 101320021959089 is a prime.
It is a super-2 number, since 2×1013200222212332 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101320022221133) 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, 13100593783 + ... + 13100601516.
It is an arithmetic number, because the mean of its divisors is an integer number (16899770968500).
Almost surely, 2101320022221233 is an apocalyptic number.
It is an amenable number.
101320022221233 is a deficient number, since it is larger than the sum of its proper divisors (33878145526767).
101320022221233 is a wasteful number, since it uses less digits than its factorization.
101320022221233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26201196591.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 101320022221233 its reverse (332122220023101), we get a palindrome (433442242244334).
The spelling of 101320022221233 in words is "one hundred one trillion, three hundred twenty billion, twenty-two million, two hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •