Base | Representation |
---|---|
bin | 1011010111111110110… |
… | …0100111010011001100 |
3 | 200200101212112210201021 |
4 | 2311333230213103030 |
5 | 11200202434230220 |
6 | 225434533323524 |
7 | 20055405666421 |
oct | 2657754472314 |
9 | 620355483637 |
10 | 195415930060 |
11 | 7596a21a64a |
12 | 31a584965a4 |
13 | 155736bb960 |
14 | 965b36dd48 |
15 | 513accb4aa |
hex | 2d7fb274cc |
195415930060 has 48 divisors (see below), whose sum is σ = 450279176256. Its totient is φ = 70792180992.
The previous prime is 195415930033. The next prime is 195415930079. The reversal of 195415930060 is 60039514591.
195415930060 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 195415929989 and 195415930016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7076784 + ... + 7104343.
It is an arithmetic number, because the mean of its divisors is an integer number (9380816172).
Almost surely, 2195415930060 is an apocalyptic number.
195415930060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
195415930060 is an abundant number, since it is smaller than the sum of its proper divisors (254863246196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195415930060 is a wasteful number, since it uses less digits than its factorization.
195415930060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14181202 (or 14181200 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 43.
The spelling of 195415930060 in words is "one hundred ninety-five billion, four hundred fifteen million, nine hundred thirty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •