Base | Representation |
---|---|
bin | 10111011111110110… |
… | …011111011110001011 |
3 | 2102010100112011112000 |
4 | 113133312133132023 |
5 | 403132443042311 |
6 | 15331331522043 |
7 | 1552143130035 |
oct | 273766373613 |
9 | 72110464460 |
10 | 25230440331 |
11 | a777a20288 |
12 | 4a81759323 |
13 | 24c11bb045 |
14 | 1314c10c55 |
15 | 9ca041056 |
hex | 5dfd9f78b |
25230440331 has 16 divisors (see below), whose sum is σ = 37381495200. Its totient is φ = 16818914304.
The previous prime is 25230440317. The next prime is 25230440353. The reversal of 25230440331 is 13304403252.
25230440331 is a `hidden beast` number, since 25 + 2 + 304 + 4 + 0 + 331 = 666.
It is not a de Polignac number, because 25230440331 - 214 = 25230423947 is a prime.
It is a super-2 number, since 2×252304403312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 25230440295 and 25230440304.
It is not an unprimeable number, because it can be changed into a prime (25230440371) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 380155 + ... + 441563.
It is an arithmetic number, because the mean of its divisors is an integer number (2336343450).
Almost surely, 225230440331 is an apocalyptic number.
25230440331 is a deficient number, since it is larger than the sum of its proper divisors (12151054869).
25230440331 is a wasteful number, since it uses less digits than its factorization.
25230440331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76635 (or 76629 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
Adding to 25230440331 its reverse (13304403252), we get a palindrome (38534843583).
The spelling of 25230440331 in words is "twenty-five billion, two hundred thirty million, four hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •