Base | Representation |
---|---|
bin | 11101011110111000010… |
… | …10011010100011011001 |
3 | 10120211202110222100101112 |
4 | 32233130022122203121 |
5 | 113044121311013111 |
6 | 2053212034030105 |
7 | 133121233462523 |
oct | 16573412324331 |
9 | 3524673870345 |
10 | 1013011032281 |
11 | 360685356036 |
12 | 1443b3418335 |
13 | 746aca30c01 |
14 | 3705c444a13 |
15 | 1b53db46e8b |
hex | ebdc29a8d9 |
1013011032281 has 2 divisors, whose sum is σ = 1013011032282. Its totient is φ = 1013011032280.
The previous prime is 1013011032263. The next prime is 1013011032323. The reversal of 1013011032281 is 1822301103101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1013010042256 + 990025 = 1006484^2 + 995^2 .
It is an emirp because it is prime and its reverse (1822301103101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1013011032281 - 210 = 1013011031257 is a prime.
It is a super-2 number, since 2×10130110322812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1013011032211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506505516140 + 506505516141.
It is an arithmetic number, because the mean of its divisors is an integer number (506505516141).
Almost surely, 21013011032281 is an apocalyptic number.
It is an amenable number.
1013011032281 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013011032281 is an equidigital number, since it uses as much as digits as its factorization.
1013011032281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 1013011032281 its reverse (1822301103101), we get a palindrome (2835312135382).
The spelling of 1013011032281 in words is "one trillion, thirteen billion, eleven million, thirty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •