Base | Representation |
---|---|
bin | 101111110000101111001010… |
… | …0101011100011011110100001 |
3 | 2001002111120112012121000220111 |
4 | 1133201132110223203132201 |
5 | 420031124421422104323 |
6 | 4045302012131411321 |
7 | 154330200262110214 |
oct | 13741362453433641 |
9 | 2032446465530814 |
10 | 420114720503713 |
11 | 11195271a3a1084 |
12 | 3b151069a53b41 |
13 | 15055856cbac41 |
14 | 75a593799377b |
15 | 3388234704c0d |
hex | 17e1794ae37a1 |
420114720503713 has 8 divisors (see below), whose sum is σ = 421880337341280. Its totient is φ = 418352562270720.
The previous prime is 420114720503707. The next prime is 420114720503791. The reversal of 420114720503713 is 317305027411024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 420114720503713 - 213 = 420114720495521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420114720503113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 864407695 + ... + 864893572.
It is an arithmetic number, because the mean of its divisors is an integer number (52735042167660).
Almost surely, 2420114720503713 is an apocalyptic number.
It is an amenable number.
420114720503713 is a deficient number, since it is larger than the sum of its proper divisors (1765616837567).
420114720503713 is a wasteful number, since it uses less digits than its factorization.
420114720503713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1729302287.
The product of its (nonzero) digits is 141120, while the sum is 40.
Adding to 420114720503713 its reverse (317305027411024), we get a palindrome (737419747914737).
The spelling of 420114720503713 in words is "four hundred twenty trillion, one hundred fourteen billion, seven hundred twenty million, five hundred three thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •