Base | Representation |
---|---|
bin | 11011101111101010111101… |
… | …100000001001101010111011 |
3 | 121000001022012121220020012011 |
4 | 123233222331200021222323 |
5 | 111443212003222421103 |
6 | 1111304403450430351 |
7 | 34462612440145324 |
oct | 3357527540115273 |
9 | 530038177806164 |
10 | 122023200201403 |
11 | 35975826414766 |
12 | 11828ab6a323b7 |
13 | 531197a378067 |
14 | 221bd50c4344b |
15 | e191842dbd6d |
hex | 6efabd809abb |
122023200201403 has 4 divisors (see below), whose sum is σ = 122024218292560. Its totient is φ = 122022182110248.
The previous prime is 122023200201277. The next prime is 122023200201407. The reversal of 122023200201403 is 304102002320221.
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 122023200201403 - 233 = 122014610266811 is a prime.
It is a super-2 number, since 2×1220232002014032 (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 (122023200201407) 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, 508865775 + ... + 509105512.
It is an arithmetic number, because the mean of its divisors is an integer number (30506054573140).
Almost surely, 2122023200201403 is an apocalyptic number.
122023200201403 is a deficient number, since it is larger than the sum of its proper divisors (1018091157).
122023200201403 is a wasteful number, since it uses less digits than its factorization.
122023200201403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1018091156.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 122023200201403 its reverse (304102002320221), we get a palindrome (426125202521624).
The spelling of 122023200201403 in words is "one hundred twenty-two trillion, twenty-three billion, two hundred million, two hundred one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •