Base | Representation |
---|---|
bin | 10100100101110101100… |
… | …010101000011110000001 |
3 | 12000021101220201111111222 |
4 | 110211311202220132001 |
5 | 141140423130101223 |
6 | 3002014405044425 |
7 | 204142264462145 |
oct | 24456542503601 |
9 | 5007356644458 |
10 | 1415016253313 |
11 | 4a61178706a3 |
12 | 1aa2a60b6715 |
13 | a3587923b70 |
14 | 4c6b6a61225 |
15 | 26c1b5d50c8 |
hex | 149758a8781 |
1415016253313 has 4 divisors (see below), whose sum is σ = 1523863657428. Its totient is φ = 1306168849200.
The previous prime is 1415016253279. The next prime is 1415016253319. The reversal of 1415016253313 is 3133526105141.
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 791053705744 + 623962547569 = 889412^2 + 789913^2 .
It is a cyclic number.
It is not a de Polignac number, because 1415016253313 - 26 = 1415016253249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1415016253319) 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, 54423702038 + ... + 54423702063.
It is an arithmetic number, because the mean of its divisors is an integer number (380965914357).
Almost surely, 21415016253313 is an apocalyptic number.
1415016253313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1415016253313 is a deficient number, since it is larger than the sum of its proper divisors (108847404115).
1415016253313 is a wasteful number, since it uses less digits than its factorization.
1415016253313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108847404114.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 1415016253313 in words is "one trillion, four hundred fifteen billion, sixteen million, two hundred fifty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •