Base | Representation |
---|---|
bin | 100001101100011011110… |
… | …010010000010011010001 |
3 | 22012100120221022121102222 |
4 | 201230123302100103101 |
5 | 300414022101000340 |
6 | 4531412112550425 |
7 | 326200045164563 |
oct | 41543362202321 |
9 | 8170527277388 |
10 | 2315453531345 |
11 | 812a84177999 |
12 | 314900852415 |
13 | 13a466b74166 |
14 | 800d6153333 |
15 | 4036c1da8b5 |
hex | 21b1bc904d1 |
2315453531345 has 4 divisors (see below), whose sum is σ = 2778544237620. Its totient is φ = 1852362825072.
The previous prime is 2315453531329. The next prime is 2315453531381. The reversal of 2315453531345 is 5431353545132.
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 874015572544 + 1441437958801 = 934888^2 + 1200599^2 .
It is a cyclic number.
It is not a de Polignac number, because 2315453531345 - 24 = 2315453531329 is a prime.
It is a super-2 number, since 2×23154535313452 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2315453531296 and 2315453531305.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231545353130 + ... + 231545353139.
It is an arithmetic number, because the mean of its divisors is an integer number (694636059405).
Almost surely, 22315453531345 is an apocalyptic number.
It is an amenable number.
2315453531345 is a deficient number, since it is larger than the sum of its proper divisors (463090706275).
2315453531345 is an equidigital number, since it uses as much as digits as its factorization.
2315453531345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 463090706274.
The product of its digits is 1620000, while the sum is 44.
The spelling of 2315453531345 in words is "two trillion, three hundred fifteen billion, four hundred fifty-three million, five hundred thirty-one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •