Base | Representation |
---|---|
bin | 11010011010001001… |
… | …100100000011101111 |
3 | 2201012011211011010110 |
4 | 122122021210003233 |
5 | 431033114031111 |
6 | 21005423311103 |
7 | 2022455016600 |
oct | 323211440357 |
9 | 81164734113 |
10 | 28356002031 |
11 | 11031251025 |
12 | 55b444b493 |
13 | 289b8c5b36 |
14 | 152dd7dda7 |
15 | b0e6385a6 |
hex | 69a2640ef |
28356002031 has 12 divisors (see below), whose sum is σ = 43980738072. Its totient is φ = 16203429648.
The previous prime is 28356002011. The next prime is 28356002041. The reversal of 28356002031 is 13020065382.
It is not a de Polignac number, because 28356002031 - 29 = 28356001519 is a prime.
It is a super-2 number, since 2×283560020312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 28356002031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28356002011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 96448840 + ... + 96449133.
It is an arithmetic number, because the mean of its divisors is an integer number (3665061506).
Almost surely, 228356002031 is an apocalyptic number.
28356002031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
28356002031 is a deficient number, since it is larger than the sum of its proper divisors (15624736041).
28356002031 is a wasteful number, since it uses less digits than its factorization.
28356002031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192897990 (or 192897983 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 28356002031 in words is "twenty-eight billion, three hundred fifty-six million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •