Base | Representation |
---|---|
bin | 11011100001100101011111… |
… | …010011001011011110011111 |
3 | 120212121202202122210000012110 |
4 | 123201211133103023132133 |
5 | 111331332124014213043 |
6 | 1105244003131405103 |
7 | 34332644666065632 |
oct | 3341453723133637 |
9 | 525552678700173 |
10 | 121055252101023 |
11 | 356322759a8409 |
12 | 116b139abb3793 |
13 | 52715cc5c08c6 |
14 | 21c716956dc19 |
15 | deddd18b4b33 |
hex | 6e195f4cb79f |
121055252101023 has 8 divisors (see below), whose sum is σ = 161475482659248. Its totient is φ = 80669261471744.
The previous prime is 121055252101001. The next prime is 121055252101037. The reversal of 121055252101023 is 320101252550121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121055252101023 - 224 = 121055235323807 is a prime.
It is a super-2 number, since 2×1210552521010232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121055252301023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8559973986 + ... + 8559988127.
It is an arithmetic number, because the mean of its divisors is an integer number (20184435332406).
Almost surely, 2121055252101023 is an apocalyptic number.
121055252101023 is a deficient number, since it is larger than the sum of its proper divisors (40420230558225).
121055252101023 is a wasteful number, since it uses less digits than its factorization.
121055252101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17119964473.
The product of its (nonzero) digits is 6000, while the sum is 30.
The spelling of 121055252101023 in words is "one hundred twenty-one trillion, fifty-five billion, two hundred fifty-two million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •