Base | Representation |
---|---|
bin | 11011100100001000011011… |
… | …000100101001101111110111 |
3 | 120220020111100011012001102102 |
4 | 123210020123010221233313 |
5 | 111342213422440220203 |
6 | 1105500215135532315 |
7 | 34351410253051220 |
oct | 3344103304515767 |
9 | 526214304161372 |
10 | 121230201101303 |
11 | 3569a492069758 |
12 | 1171b28508a09b |
13 | 5284c6095b108 |
14 | 21d18045d0247 |
15 | e03720940888 |
hex | 6e421b129bf7 |
121230201101303 has 32 divisors (see below), whose sum is σ = 141830416320000. Its totient is φ = 101475464238720.
The previous prime is 121230201101291. The next prime is 121230201101333. The reversal of 121230201101303 is 303101102032121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 121230201101303 - 26 = 121230201101239 is a prime.
It is a super-2 number, since 2×1212302011013032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121230201101333) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 138197288 + ... + 139071746.
It is an arithmetic number, because the mean of its divisors is an integer number (4432200510000).
Almost surely, 2121230201101303 is an apocalyptic number.
121230201101303 is a deficient number, since it is larger than the sum of its proper divisors (20600215218697).
121230201101303 is a wasteful number, since it uses less digits than its factorization.
121230201101303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 876855.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 121230201101303 its reverse (303101102032121), we get a palindrome (424331303133424).
The spelling of 121230201101303 in words is "one hundred twenty-one trillion, two hundred thirty billion, two hundred one million, one hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •