Base | Representation |
---|---|
bin | 101111001001000001… |
… | …0110000111011100010 |
3 | 100200022012110200212210 |
4 | 1132102002300323202 |
5 | 3124312004233200 |
6 | 114301221302550 |
7 | 10212453410403 |
oct | 1362202607342 |
9 | 320265420783 |
10 | 101234446050 |
11 | 39a2a229751 |
12 | 17753264a56 |
13 | 97144a47aa |
14 | 4c84d999aa |
15 | 29777cb650 |
hex | 17920b0ee2 |
101234446050 has 24 divisors (see below), whose sum is σ = 251061426576. Its totient is φ = 26995852240.
The previous prime is 101234446037. The next prime is 101234446067. The reversal of 101234446050 is 50644432101.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 101234445999 and 101234446017.
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 11 ways as a sum of consecutive naturals, for example, 337448004 + ... + 337448303.
It is an arithmetic number, because the mean of its divisors is an integer number (10460892774).
Almost surely, 2101234446050 is an apocalyptic number.
101234446050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101234446050 is an abundant number, since it is smaller than the sum of its proper divisors (149826980526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101234446050 is a wasteful number, since it uses less digits than its factorization.
101234446050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674896322 (or 674896317 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 101234446050 its reverse (50644432101), we get a palindrome (151878878151).
The spelling of 101234446050 in words is "one hundred one billion, two hundred thirty-four million, four hundred forty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •