Base | Representation |
---|---|
bin | 1011010111010110011… |
… | …1011101011000011000 |
3 | 200122222002022102212122 |
4 | 2311311213131120120 |
5 | 11144331140302202 |
6 | 225410052400412 |
7 | 20051253321110 |
oct | 2656547353030 |
9 | 618862272778 |
10 | 195246806552 |
11 | 75892806656 |
12 | 31a0b916108 |
13 | 15547655585 |
14 | 9642b08040 |
15 | 512b0209a2 |
hex | 2d759dd618 |
195246806552 has 16 divisors (see below), whose sum is σ = 418386014160. Its totient is φ = 83677202784.
The previous prime is 195246806551. The next prime is 195246806563. The reversal of 195246806552 is 255608642591.
It is a super-2 number, since 2×1952468065522 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 195246806494 and 195246806503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195246806551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1743275003 + ... + 1743275114.
It is an arithmetic number, because the mean of its divisors is an integer number (26149125885).
Almost surely, 2195246806552 is an apocalyptic number.
It is an amenable number.
195246806552 is an abundant number, since it is smaller than the sum of its proper divisors (223139207608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195246806552 is a wasteful number, since it uses less digits than its factorization.
195246806552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3486550130 (or 3486550126 counting only the distinct ones).
The product of its (nonzero) digits is 5184000, while the sum is 53.
The spelling of 195246806552 in words is "one hundred ninety-five billion, two hundred forty-six million, eight hundred six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •