Base | Representation |
---|---|
bin | 100000110101010110101… |
… | …011111110111100110101 |
3 | 21222200221021110202001001 |
4 | 200311112223332330311 |
5 | 243431411410413023 |
6 | 4444311401003301 |
7 | 322004343160153 |
oct | 40652653767465 |
9 | 7880837422031 |
10 | 2256312201013 |
11 | 79a995463092 |
12 | 305356483531 |
13 | 134a0029c440 |
14 | 7b2c573c3d3 |
15 | 3da5a04d6ad |
hex | 20d56afef35 |
2256312201013 has 8 divisors (see below), whose sum is σ = 2475721370808. Its totient is φ = 2043452558784.
The previous prime is 2256312200999. The next prime is 2256312201037. The reversal of 2256312201013 is 3101022136522.
It can be written as a sum of positive squares in 4 ways, for example, as 697814634609 + 1558497566404 = 835353^2 + 1248398^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2256312201013 - 213 = 2256312192821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2256312201053) 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, 1637381170 + ... + 1637382547.
It is an arithmetic number, because the mean of its divisors is an integer number (309465171351).
Almost surely, 22256312201013 is an apocalyptic number.
It is an amenable number.
2256312201013 is a deficient number, since it is larger than the sum of its proper divisors (219409169795).
2256312201013 is a wasteful number, since it uses less digits than its factorization.
2256312201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3274763783.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 2256312201013 its reverse (3101022136522), we get a palindrome (5357334337535).
The spelling of 2256312201013 in words is "two trillion, two hundred fifty-six billion, three hundred twelve million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •