Base | Representation |
---|---|
bin | 11101011001101100001… |
… | …11000011111000001001 |
3 | 10120120120022211002220221 |
4 | 32230312013003320021 |
5 | 113022420113310423 |
6 | 2052031354350041 |
7 | 132662214652405 |
oct | 16546607037011 |
9 | 3516508732827 |
10 | 1010225135113 |
11 | 35a485830287 |
12 | 14395642b321 |
13 | 74357800b4c |
14 | 36c76452105 |
15 | 1b429295e5d |
hex | eb361c3e09 |
1010225135113 has 8 divisors (see below), whose sum is σ = 1026099785088. Its totient is φ = 994405510944.
The previous prime is 1010225135111. The next prime is 1010225135159. The reversal of 1010225135113 is 3115315220101.
1010225135113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1010225135113 - 21 = 1010225135111 is a prime.
It is a super-2 number, since 2×10102251351132 (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 (1010225135111) 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, 13719445 + ... + 13792882.
It is an arithmetic number, because the mean of its divisors is an integer number (128262473136).
Almost surely, 21010225135113 is an apocalyptic number.
It is an amenable number.
1010225135113 is a deficient number, since it is larger than the sum of its proper divisors (15874649975).
1010225135113 is an equidigital number, since it uses as much as digits as its factorization.
1010225135113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27512903.
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 1010225135113 in words is "one trillion, ten billion, two hundred twenty-five million, one hundred thirty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •