Base | Representation |
---|---|
bin | 101010111000100100… |
… | …011010111101100000 |
3 | 11101212001002202111201 |
4 | 222320210122331200 |
5 | 1223300313301240 |
6 | 33053042250544 |
7 | 3220032324421 |
oct | 527044327540 |
9 | 141761082451 |
10 | 46046228320 |
11 | 18589993954 |
12 | 8b10956a54 |
13 | 445a8b5a61 |
14 | 232b5b1648 |
15 | 12e7701d9a |
hex | ab891af60 |
46046228320 has 24 divisors (see below), whose sum is σ = 108784214784. Its totient is φ = 18418491264.
The previous prime is 46046228287. The next prime is 46046228353. The reversal of 46046228320 is 2382264064.
It is an interprime number because it is at equal distance from previous prime (46046228287) and next prime (46046228353).
It is a self number, because there is not a number n which added to its sum of digits gives 46046228320.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 143894304 + ... + 143894623.
It is an arithmetic number, because the mean of its divisors is an integer number (4532675616).
Almost surely, 246046228320 is an apocalyptic number.
46046228320 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
46046228320 is an abundant number, since it is smaller than the sum of its proper divisors (62737986464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46046228320 is a wasteful number, since it uses less digits than its factorization.
46046228320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287788942 (or 287788934 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 37.
The spelling of 46046228320 in words is "forty-six billion, forty-six million, two hundred twenty-eight thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •