Base | Representation |
---|---|
bin | 1110111100110101011… |
… | …0111001000000010010 |
3 | 220112222012120122100121 |
4 | 3233031112321000102 |
5 | 13202011142303102 |
6 | 313554452340454 |
7 | 24361641244456 |
oct | 3571526710022 |
9 | 815865518317 |
10 | 256848400402 |
11 | 99a242538a0 |
12 | 4194201472a |
13 | 1b2b3b55b19 |
14 | c608188666 |
15 | 6a34189b37 |
hex | 3bcd5b9012 |
256848400402 has 64 divisors (see below), whose sum is σ = 438573864960. Its totient is φ = 111783672000.
The previous prime is 256848400363. The next prime is 256848400409. The reversal of 256848400402 is 204004848652.
256848400402 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2568484004022 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is not an unprimeable number, because it can be changed into a prime (256848400409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 109249527 + ... + 109251877.
It is an arithmetic number, because the mean of its divisors is an integer number (6852716640).
Almost surely, 2256848400402 is an apocalyptic number.
256848400402 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
256848400402 is a deficient number, since it is larger than the sum of its proper divisors (181725464558).
256848400402 is a wasteful number, since it uses less digits than its factorization.
256848400402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4639.
The product of its (nonzero) digits is 491520, while the sum is 43.
The spelling of 256848400402 in words is "two hundred fifty-six billion, eight hundred forty-eight million, four hundred thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •