Base | Representation |
---|---|
bin | 11011111110000010000000… |
… | …100111100001100011001010 |
3 | 121010112122100212201010100201 |
4 | 123332002000213201203022 |
5 | 112110344010411431442 |
6 | 1113342005033322414 |
7 | 34624115666230045 |
oct | 3376020047414312 |
9 | 533478325633321 |
10 | 123010021202122 |
11 | 3621629111640a |
12 | 119681bb26640a |
13 | 5383a4515b672 |
14 | 2253a06c47c5c |
15 | e34b8da447b7 |
hex | 6fe0809e18ca |
123010021202122 has 4 divisors (see below), whose sum is σ = 184515031803186. Its totient is φ = 61505010601060.
The previous prime is 123010021202099. The next prime is 123010021202129. The reversal of 123010021202122 is 221202120010321.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 119647085065561 + 3362936136561 = 10938331^2 + 1833831^2 .
It is a super-2 number, since 2×1230100212021222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 123010021202122.
It is not an unprimeable number, because it can be changed into a prime (123010021202129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30752505300529 + ... + 30752505300532.
Almost surely, 2123010021202122 is an apocalyptic number.
123010021202122 is a deficient number, since it is larger than the sum of its proper divisors (61505010601064).
123010021202122 is an equidigital number, since it uses as much as digits as its factorization.
123010021202122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61505010601063.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 123010021202122 its reverse (221202120010321), we get a palindrome (344212141212443).
The spelling of 123010021202122 in words is "one hundred twenty-three trillion, ten billion, twenty-one million, two hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •