Base | Representation |
---|---|
bin | 111000010111000100… |
… | …0101011111011100001 |
3 | 102120102000011012112111 |
4 | 1300232020223323201 |
5 | 3440333434111223 |
6 | 131333555355321 |
7 | 11513212326400 |
oct | 1605610537341 |
9 | 376360135474 |
10 | 121033113313 |
11 | 4736a045482 |
12 | 1b5598b2b41 |
13 | b54b249618 |
14 | 5c02633637 |
15 | 3235a2830d |
hex | 1c2e22bee1 |
121033113313 has 6 divisors (see below), whose sum is σ = 140793621666. Its totient is φ = 103742668512.
The previous prime is 121033113293. The next prime is 121033113329. The reversal of 121033113313 is 313311330121.
It can be written as a sum of positive squares in only one way, i.e., 98590976064 + 22442137249 = 313992^2 + 149807^2 .
It is not a de Polignac number, because 121033113313 - 225 = 120999558881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121033113373) 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 5 ways as a sum of consecutive naturals, for example, 1235031720 + ... + 1235031817.
It is an arithmetic number, because the mean of its divisors is an integer number (23465603611).
Almost surely, 2121033113313 is an apocalyptic number.
It is an amenable number.
121033113313 is a deficient number, since it is larger than the sum of its proper divisors (19760508353).
121033113313 is an equidigital number, since it uses as much as digits as its factorization.
121033113313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2470063551 (or 2470063544 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 121033113313 its reverse (313311330121), we get a palindrome (434344443434).
The spelling of 121033113313 in words is "one hundred twenty-one billion, thirty-three million, one hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •