Base | Representation |
---|---|
bin | 10100011000000010011… |
… | …100101111000010011010 |
3 | 11221212011101010110202012 |
4 | 110120002130233002122 |
5 | 140420102302110001 |
6 | 2551124310305522 |
7 | 203106162146222 |
oct | 24300234570232 |
9 | 4855141113665 |
10 | 1400200425626 |
11 | 49a904701002 |
12 | 1a74503582a2 |
13 | a20662acb12 |
14 | 4baad09d082 |
15 | 26650a502bb |
hex | 1460272f09a |
1400200425626 has 4 divisors (see below), whose sum is σ = 2100300638442. Its totient is φ = 700100212812.
The previous prime is 1400200425593. The next prime is 1400200425629. The reversal of 1400200425626 is 6265240020041.
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., 1176281239225 + 223919186401 = 1084565^2 + 473201^2 .
It is a super-2 number, since 2×14002004256262 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1400200425592 and 1400200425601.
It is not an unprimeable number, because it can be changed into a prime (1400200425629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 350050106405 + ... + 350050106408.
Almost surely, 21400200425626 is an apocalyptic number.
1400200425626 is a deficient number, since it is larger than the sum of its proper divisors (700100212816).
1400200425626 is an equidigital number, since it uses as much as digits as its factorization.
1400200425626 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700100212815.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 1400200425626 its reverse (6265240020041), we get a palindrome (7665440445667).
The spelling of 1400200425626 in words is "one trillion, four hundred billion, two hundred million, four hundred twenty-five thousand, six hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •