Base | Representation |
---|---|
bin | 11011100101100111010101… |
… | …100000001010011011011000 |
3 | 120220121020101120122011101201 |
4 | 123211213111200022123120 |
5 | 111400401131424414112 |
6 | 1110015111524123544 |
7 | 34361645604666130 |
oct | 3345472540123330 |
9 | 526536346564351 |
10 | 121332113123032 |
11 | 35729729810aa9 |
12 | 11736b872365b4 |
13 | 5291752620256 |
14 | 21d6711567ac0 |
15 | e061d7960257 |
hex | 6e59d580a6d8 |
121332113123032 has 16 divisors (see below), whose sum is σ = 259997385263760. Its totient is φ = 51999477052704.
The previous prime is 121332113123009. The next prime is 121332113123041. The reversal of 121332113123032 is 230321311233121.
It is a Harshad number since it is a multiple of its sum of digits (28).
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, 1083322438543 + ... + 1083322438654.
It is an arithmetic number, because the mean of its divisors is an integer number (16249836578985).
Almost surely, 2121332113123032 is an apocalyptic number.
It is an amenable number.
121332113123032 is an abundant number, since it is smaller than the sum of its proper divisors (138665272140728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121332113123032 is a wasteful number, since it uses less digits than its factorization.
121332113123032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2166644877210 (or 2166644877206 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 121332113123032 its reverse (230321311233121), we get a palindrome (351653424356153).
The spelling of 121332113123032 in words is "one hundred twenty-one trillion, three hundred thirty-two billion, one hundred thirteen million, one hundred twenty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •