Base | Representation |
---|---|
bin | 111000010110111100… |
… | …1011010110011101111 |
3 | 102120101201121212102112 |
4 | 1300231321122303233 |
5 | 3440331423023043 |
6 | 131333333514235 |
7 | 11513133320042 |
oct | 1605571326357 |
9 | 376351555375 |
10 | 121029111023 |
11 | 473678614a7 |
12 | 1b5584a297b |
13 | b54a4779c2 |
14 | 5c01cb0c59 |
15 | 32354d7518 |
hex | 1c2de5acef |
121029111023 has 4 divisors (see below), whose sum is σ = 121033838568. Its totient is φ = 121024383480.
The previous prime is 121029111019. The next prime is 121029111029. The reversal of 121029111023 is 320111920121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121029111023 - 22 = 121029111019 is a prime.
It is a super-3 number, since 3×1210291110233 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121029111023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121029111029) by changing a digit.
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, 2325161 + ... + 2376642.
It is an arithmetic number, because the mean of its divisors is an integer number (30258459642).
Almost surely, 2121029111023 is an apocalyptic number.
121029111023 is a deficient number, since it is larger than the sum of its proper divisors (4727545).
121029111023 is an equidigital number, since it uses as much as digits as its factorization.
121029111023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4727544.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 121029111023 in words is "one hundred twenty-one billion, twenty-nine million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •