Base | Representation |
---|---|
bin | 100000001100110000011011… |
… | …0110000001001100011101010 |
3 | 1101010211100121011021012211210 |
4 | 1000121200312300021203222 |
5 | 244110402414420143041 |
6 | 2442213131430533550 |
7 | 113441364603355461 |
oct | 10031406660114352 |
9 | 1333740534235753 |
10 | 283228241959146 |
11 | 82277471928270 |
12 | 279236452072b6 |
13 | c206402046693 |
14 | 4dd246a3279d8 |
15 | 22b263ac9e016 |
hex | 1019836c098ea |
283228241959146 has 16 divisors (see below), whose sum is σ = 617952527911008. Its totient is φ = 85826739987600.
The previous prime is 283228241959111. The next prime is 283228241959151. The reversal of 283228241959146 is 641959142822382.
It is a Harshad number since it is a multiple of its sum of digits (66), and also a Moran number because the ratio is a prime number: 4291336999381 = 283228241959146 / (2 + 8 + 3 + 2 + 2 + 8 + 2 + 4 + 1 + 9 + 5 + 9 + 1 + 4 + 6).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2145668499625 + ... + 2145668499756.
It is an arithmetic number, because the mean of its divisors is an integer number (38622032994438).
Almost surely, 2283228241959146 is an apocalyptic number.
283228241959146 is an abundant number, since it is smaller than the sum of its proper divisors (334724285951862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
283228241959146 is a wasteful number, since it uses less digits than its factorization.
283228241959146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4291336999397.
The product of its digits is 119439360, while the sum is 66.
The spelling of 283228241959146 in words is "two hundred eighty-three trillion, two hundred twenty-eight billion, two hundred forty-one million, nine hundred fifty-nine thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •