Base | Representation |
---|---|
bin | 11101011110001110001… |
… | …100110101010100011111 |
3 | 21011121200201002121122200 |
4 | 131132032030311110133 |
5 | 231140321210401330 |
6 | 4150230024142543 |
7 | 266216126134650 |
oct | 35361614652437 |
9 | 7147621077580 |
10 | 2025315325215 |
11 | 710a27779366 |
12 | 28862a007a53 |
13 | 118ca9203050 |
14 | 70050a79527 |
15 | 37a3a6d9a60 |
hex | 1d78e33551f |
2025315325215 has 96 divisors (see below), whose sum is σ = 4321258206720. Its totient is φ = 854522742528.
The previous prime is 2025315325211. The next prime is 2025315325249. The reversal of 2025315325215 is 5125235135202.
2025315325215 is a `hidden beast` number, since 2 + 0 + 2 + 5 + 315 + 325 + 2 + 15 = 666.
It is not a de Polignac number, because 2025315325215 - 22 = 2025315325211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2025315325215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2025315325211) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 34544796 + ... + 34603374.
It is an arithmetic number, because the mean of its divisors is an integer number (45013106320).
Almost surely, 22025315325215 is an apocalyptic number.
2025315325215 is an abundant number, since it is smaller than the sum of its proper divisors (2295942881505).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2025315325215 is a wasteful number, since it uses less digits than its factorization.
2025315325215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67053 (or 67050 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The spelling of 2025315325215 in words is "two trillion, twenty-five billion, three hundred fifteen million, three hundred twenty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •