Base | Representation |
---|---|
bin | 101011101111000110… |
… | …0011011101000000010 |
3 | 22222102121000202010200 |
4 | 1113132030123220002 |
5 | 3014323030122200 |
6 | 111051444510030 |
7 | 6533322540252 |
oct | 1273614335002 |
9 | 288377022120 |
10 | 93922114050 |
11 | 36917648466 |
12 | 162523ab316 |
13 | 8b1a57391b |
14 | 478db79962 |
15 | 269a869800 |
hex | 15de31ba02 |
93922114050 has 54 divisors (see below), whose sum is σ = 252354880713. Its totient is φ = 25044163440.
The previous prime is 93922114037. The next prime is 93922114061. The reversal of 93922114050 is 5041122939.
93922114050 is a `hidden beast` number, since 9 + 39 + 2 + 211 + 405 + 0 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 92043671769 + 1878442281 = 303387^2 + 43341^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=216705.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 93922113996 and 93922114014.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 6493927 + ... + 6508373.
Almost surely, 293922114050 is an apocalyptic number.
93922114050 is a gapful number since it is divisible by the number (90) formed by its first and last digit.
93922114050 is an abundant number, since it is smaller than the sum of its proper divisors (158432766663).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
93922114050 is an equidigital number, since it uses as much as digits as its factorization.
93922114050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28912 (or 14457 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
Adding to 93922114050 its reverse (5041122939), we get a palindrome (98963236989).
The spelling of 93922114050 in words is "ninety-three billion, nine hundred twenty-two million, one hundred fourteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •