Base | Representation |
---|---|
bin | 101101100000001001001111… |
… | …100101100000101010011001 |
3 | 222020120101101110102102212010 |
4 | 231200021033211200222121 |
5 | 202212240343101014001 |
6 | 1545342200503140133 |
7 | 60103160651403546 |
oct | 5540111745405231 |
9 | 866511343372763 |
10 | 200121041423001 |
11 | 58845947813a36 |
12 | 1a54096ba44649 |
13 | 878844415787a |
14 | 375bca53bbbcd |
15 | 182091a6a98d6 |
hex | b6024f960a99 |
200121041423001 has 4 divisors (see below), whose sum is σ = 266828055230672. Its totient is φ = 133414027615332.
The previous prime is 200121041422927. The next prime is 200121041423027. The reversal of 200121041423001 is 100324140121002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 200121041423001 - 211 = 200121041420953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200121041223001) 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, 33353506903831 + ... + 33353506903836.
It is an arithmetic number, because the mean of its divisors is an integer number (66707013807668).
Almost surely, 2200121041423001 is an apocalyptic number.
It is an amenable number.
200121041423001 is a deficient number, since it is larger than the sum of its proper divisors (66707013807671).
200121041423001 is an equidigital number, since it uses as much as digits as its factorization.
200121041423001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66707013807670.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 200121041423001 its reverse (100324140121002), we get a palindrome (300445181544003).
The spelling of 200121041423001 in words is "two hundred trillion, one hundred twenty-one billion, forty-one million, four hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •