Base | Representation |
---|---|
bin | 1011100000111010111… |
… | …00001111111111111111 |
3 | 1101211012012101220222222 |
4 | 11300131130033333333 |
5 | 22440223004423223 |
6 | 501430023555555 |
7 | 40404050320166 |
oct | 5603534177777 |
9 | 1354165356888 |
10 | 395630936063 |
11 | 142871392a60 |
12 | 64813bbbbbb |
13 | 2b40041a3cc |
14 | 15211c1c3dd |
15 | a4580710c8 |
hex | 5c1d70ffff |
395630936063 has 16 divisors (see below), whose sum is σ = 435243720192. Its totient is φ = 356638464000.
The previous prime is 395630936021. The next prime is 395630936069. The reversal of 395630936063 is 360639036593.
It is a happy number.
It is a Cunningham number, because it is equal to 6289922-1.
It is a cyclic number.
It is not a de Polignac number, because 395630936063 - 28 = 395630935807 is a prime.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 395630935996 and 395630936014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (395630936069) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 314495 + ... + 943487.
It is an arithmetic number, because the mean of its divisors is an integer number (27202732512).
Almost surely, 2395630936063 is an apocalyptic number.
395630936063 is a deficient number, since it is larger than the sum of its proper divisors (39612784129).
395630936063 is a wasteful number, since it uses less digits than its factorization.
395630936063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629486.
The product of its (nonzero) digits is 7085880, while the sum is 53.
The spelling of 395630936063 in words is "three hundred ninety-five billion, six hundred thirty million, nine hundred thirty-six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •