Base | Representation |
---|---|
bin | 10100011000000011111… |
… | …000010100101100111011 |
3 | 11221212020001022021102101 |
4 | 110120003320110230323 |
5 | 140420124423410003 |
6 | 2551130525044231 |
7 | 203106603214342 |
oct | 24300370245473 |
9 | 4855201267371 |
10 | 1400224435003 |
11 | 49a91720a669 |
12 | 1a74583b6677 |
13 | a206b268154 |
14 | 4bab234cb59 |
15 | 26652be411d |
hex | 14603e14b3b |
1400224435003 has 32 divisors (see below), whose sum is σ = 1519037245440. Its totient is φ = 1286715978240.
The previous prime is 1400224434989. The next prime is 1400224435007. The reversal of 1400224435003 is 3005344220041.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1400224435003 is a prime.
It is a super-2 number, since 2×14002244350032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1400224435007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 123004450 + ... + 123015832.
It is an arithmetic number, because the mean of its divisors is an integer number (47469913920).
Almost surely, 21400224435003 is an apocalyptic number.
1400224435003 is a deficient number, since it is larger than the sum of its proper divisors (118812810437).
1400224435003 is a wasteful number, since it uses less digits than its factorization.
1400224435003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12339.
The product of its (nonzero) digits is 11520, while the sum is 28.
Adding to 1400224435003 its reverse (3005344220041), we get a palindrome (4405568655044).
The spelling of 1400224435003 in words is "one trillion, four hundred billion, two hundred twenty-four million, four hundred thirty-five thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •