Base | Representation |
---|---|
bin | 11011111110001011011111… |
… | …011001010000011010001011 |
3 | 121010120121122100020020001202 |
4 | 123332023133121100122023 |
5 | 112111030333003411021 |
6 | 1113350411130534415 |
7 | 34624626161113346 |
oct | 3376133731203213 |
9 | 533517570206052 |
10 | 123020201232011 |
11 | 3621a635513556 |
12 | 1196a18059740b |
13 | 53849a82304a5 |
14 | 22542d0c7145d |
15 | e35087614a0b |
hex | 6fe2df65068b |
123020201232011 has 4 divisors (see below), whose sum is σ = 123057000577632. Its totient is φ = 122983401886392.
The previous prime is 123020201232001. The next prime is 123020201232017. The reversal of 123020201232011 is 110232102020321.
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 123020201232011 - 230 = 123019127490187 is a prime.
It is a super-2 number, since 2×1230202012320112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123020201232017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18399667796 + ... + 18399674481.
It is an arithmetic number, because the mean of its divisors is an integer number (30764250144408).
Almost surely, 2123020201232011 is an apocalyptic number.
123020201232011 is a deficient number, since it is larger than the sum of its proper divisors (36799345621).
123020201232011 is an equidigital number, since it uses as much as digits as its factorization.
123020201232011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36799345620.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 123020201232011 its reverse (110232102020321), we get a palindrome (233252303252332).
The spelling of 123020201232011 in words is "one hundred twenty-three trillion, twenty billion, two hundred one million, two hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •