Base | Representation |
---|---|
bin | 111101110110110010010… |
… | …000000001011110001011 |
3 | 120001100211111210220020121 |
4 | 331312302100001132023 |
5 | 1024120430034404043 |
6 | 13012430052004111 |
7 | 616050431023516 |
oct | 75666220013613 |
9 | 16040744726217 |
10 | 4250713200523 |
11 | 1399798870a39 |
12 | 587997300637 |
13 | 24aac086926a |
14 | 109a42763d7d |
15 | 75886702ded |
hex | 3ddb240178b |
4250713200523 has 4 divisors (see below), whose sum is σ = 4349566995928. Its totient is φ = 4151859405120.
The previous prime is 4250713200521. The next prime is 4250713200533. The reversal of 4250713200523 is 3250023170524.
4250713200523 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4250713200523 - 21 = 4250713200521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4250713200521) 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, 49426897638 + ... + 49426897723.
It is an arithmetic number, because the mean of its divisors is an integer number (1087391748982).
Almost surely, 24250713200523 is an apocalyptic number.
4250713200523 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
4250713200523 is a deficient number, since it is larger than the sum of its proper divisors (98853795405).
4250713200523 is an equidigital number, since it uses as much as digits as its factorization.
4250713200523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98853795404.
The product of its (nonzero) digits is 50400, while the sum is 34.
The spelling of 4250713200523 in words is "four trillion, two hundred fifty billion, seven hundred thirteen million, two hundred thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •