Base | Representation |
---|---|
bin | 1101110111101010110111… |
… | …11100110101111010101000 |
3 | 10222222210002210022122010012 |
4 | 12323311123330311322220 |
5 | 12444203203443220112 |
6 | 144511315514311052 |
7 | 6265363021466516 |
oct | 673653374657250 |
9 | 128883083278105 |
10 | 30500105445032 |
11 | 979a027429a03 |
12 | 350715b728488 |
13 | 14031bc389022 |
14 | 7762da5bb4b6 |
15 | 37d59ecda022 |
hex | 1bbd5bf35ea8 |
30500105445032 has 8 divisors (see below), whose sum is σ = 57187697709450. Its totient is φ = 15250052722512.
The previous prime is 30500105444999. The next prime is 30500105445059. The reversal of 30500105445032 is 23054450100503.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 19347805120996 + 11152300324036 = 4398614^2 + 3339506^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 30500105445032.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1906256590307 + ... + 1906256590322.
Almost surely, 230500105445032 is an apocalyptic number.
It is an amenable number.
30500105445032 is a deficient number, since it is larger than the sum of its proper divisors (26687592264418).
30500105445032 is a wasteful number, since it uses less digits than its factorization.
30500105445032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3812513180635 (or 3812513180631 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 30500105445032 its reverse (23054450100503), we get a palindrome (53554555545535).
The spelling of 30500105445032 in words is "thirty trillion, five hundred billion, one hundred five million, four hundred forty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •