Base | Representation |
---|---|
bin | 1000100001000010… |
… | …0100110000111010 |
3 | 12220022121011221020 |
4 | 2020100210300322 |
5 | 14140211440031 |
6 | 1014501523310 |
7 | 110436033630 |
oct | 21020446072 |
9 | 5808534836 |
10 | 2286046266 |
11 | a73460439 |
12 | 539713536 |
13 | 2a57caaca |
14 | 179879350 |
15 | d5a67096 |
hex | 88424c3a |
2286046266 has 64 divisors (see below), whose sum is σ = 5372752896. Its totient is φ = 634838400.
The previous prime is 2286046261. The next prime is 2286046267. The reversal of 2286046266 is 6626406822.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (2286046261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 484981 + ... + 489671.
It is an arithmetic number, because the mean of its divisors is an integer number (83949264).
Almost surely, 22286046266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2286046266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2686376448).
2286046266 is an abundant number, since it is smaller than the sum of its proper divisors (3086706630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2286046266 is a wasteful number, since it uses less digits than its factorization.
2286046266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5027.
The product of its (nonzero) digits is 331776, while the sum is 42.
The square root of 2286046266 is about 47812.6161802510. The cubic root of 2286046266 is about 1317.3312828443.
The spelling of 2286046266 in words is "two billion, two hundred eighty-six million, forty-six thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •