Base | Representation |
---|---|
bin | 11101011110111000001… |
… | …10101000110110010001 |
3 | 10120211202102010001022222 |
4 | 32233130012220312101 |
5 | 113044121032323012 |
6 | 2053212000510425 |
7 | 133121222200253 |
oct | 16573406506621 |
9 | 3524672101288 |
10 | 1013010042257 |
11 | 36068483a234 |
12 | 1443b301b415 |
13 | 746ac7753b5 |
14 | 3705c267cd3 |
15 | 1b53d9ed972 |
hex | ebdc1a8d91 |
1013010042257 has 4 divisors (see below), whose sum is σ = 1013014182180. Its totient is φ = 1013005902336.
The previous prime is 1013010042251. The next prime is 1013010042281. The reversal of 1013010042257 is 7522400103101.
It is a Cunningham number, because it is equal to 10064842+1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 435700325776 + 577309716481 = 660076^2 + 759809^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013010042257 - 214 = 1013010025873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013010042251) 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, 1678208 + ... + 2200545.
It is an arithmetic number, because the mean of its divisors is an integer number (253253545545).
Almost surely, 21013010042257 is an apocalyptic number.
It is an amenable number.
1013010042257 is a deficient number, since it is larger than the sum of its proper divisors (4139923).
1013010042257 is an equidigital number, since it uses as much as digits as its factorization.
1013010042257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4139922.
The product of its (nonzero) digits is 1680, while the sum is 26.
Adding to 1013010042257 its reverse (7522400103101), we get a palindrome (8535410145358).
The spelling of 1013010042257 in words is "one trillion, thirteen billion, ten million, forty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •