Base | Representation |
---|---|
bin | 1011110001000100101010101… |
… | …1000101011000111000111000 |
3 | 11000120202012211021212010000010 |
4 | 2330101022223011120320320 |
5 | 1332012123431433141011 |
6 | 12053011354522541520 |
7 | 336256632020303550 |
oct | 27421125305307070 |
9 | 4016665737763003 |
10 | 828012435443256 |
11 | 21a915113628098 |
12 | 78a4a4353678a0 |
13 | 297033120a921b |
14 | 1086803115a160 |
15 | 65ad784b3e1a6 |
hex | 2f112ab158e38 |
828012435443256 has 32 divisors (see below), whose sum is σ = 2365749815552640. Its totient is φ = 236574981555168.
The previous prime is 828012435443129. The next prime is 828012435443261. The reversal of 828012435443256 is 652344534210828.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 828012435443196 and 828012435443205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2464322724366 + ... + 2464322724701.
It is an arithmetic number, because the mean of its divisors is an integer number (73929681736020).
Almost surely, 2828012435443256 is an apocalyptic number.
It is an amenable number.
828012435443256 is an abundant number, since it is smaller than the sum of its proper divisors (1537737380109384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
828012435443256 is a wasteful number, since it uses less digits than its factorization.
828012435443256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4928645449083 (or 4928645449079 counting only the distinct ones).
The product of its (nonzero) digits is 44236800, while the sum is 57.
The spelling of 828012435443256 in words is "eight hundred twenty-eight trillion, twelve billion, four hundred thirty-five million, four hundred forty-three thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •