Base | Representation |
---|---|
bin | 10110111001011000110111… |
… | …11010110110001100111000 |
3 | 20121021110002212011112112202 |
4 | 23130230123322312030320 |
5 | 23044420024211202300 |
6 | 255030350214525332 |
7 | 13414460051444243 |
oct | 1334543372661470 |
9 | 217243085145482 |
10 | 50350370022200 |
11 | 15052521278606 |
12 | 57922a5066848 |
13 | 2213033b68041 |
14 | c60d8427a25a |
15 | 5c4ade404ad5 |
hex | 2dcb1beb6338 |
50350370022200 has 48 divisors (see below), whose sum is σ = 117317449848480. Its totient is φ = 20096648732160.
The previous prime is 50350370022167. The next prime is 50350370022217. The reversal of 50350370022200 is 222007305305.
It is a happy number.
It is a super-2 number, since 2×503503700222002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 271777649 + ... + 271962848.
It is an arithmetic number, because the mean of its divisors is an integer number (2444113538510).
Almost surely, 250350370022200 is an apocalyptic number.
50350370022200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50350370022200 is an abundant number, since it is smaller than the sum of its proper divisors (66967079826280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50350370022200 is a wasteful number, since it uses less digits than its factorization.
50350370022200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 543740976 (or 543740967 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 29.
Adding to 50350370022200 its reverse (222007305305), we get a palindrome (50572377327505).
The spelling of 50350370022200 in words is "fifty trillion, three hundred fifty billion, three hundred seventy million, twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •