Base | Representation |
---|---|
bin | 1000111000111011011… |
… | …01011010001101101100 |
3 | 1002012101201100121202000 |
4 | 10130131231122031230 |
5 | 20001020411334012 |
6 | 352152343132300 |
7 | 31032054456300 |
oct | 4343555321554 |
9 | 1065351317660 |
10 | 305441121132 |
11 | 10859a606124 |
12 | 4b243744090 |
13 | 22a59198a04 |
14 | 10ad7a2dd00 |
15 | 7e2a1ecddc |
hex | 471db5a36c |
305441121132 has 144 divisors (see below), whose sum is σ = 946068772320. Its totient is φ = 84910218624.
The previous prime is 305441121103. The next prime is 305441121203. The reversal of 305441121132 is 231121144503.
305441121132 is a `hidden beast` number, since 3 + 0 + 5 + 4 + 411 + 211 + 32 = 666.
It is a super-2 number, since 2×3054411211322 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 305441121096 and 305441121105.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 584163 + ... + 975770.
It is an arithmetic number, because the mean of its divisors is an integer number (6569922030).
Almost surely, 2305441121132 is an apocalyptic number.
It is an amenable number.
305441121132 is an abundant number, since it is smaller than the sum of its proper divisors (640627651188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305441121132 is a wasteful number, since it uses less digits than its factorization.
305441121132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1559997 (or 1559982 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 305441121132 its reverse (231121144503), we get a palindrome (536562265635).
The spelling of 305441121132 in words is "three hundred five billion, four hundred forty-one million, one hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •