Base | Representation |
---|---|
bin | 10111001100110101000010… |
… | …010011111001010111101011 |
3 | 111101021121102121122220000221 |
4 | 113030311002103321113223 |
5 | 101333232030021004201 |
6 | 1001002553512310511 |
7 | 30330622215244651 |
oct | 2714650223712753 |
9 | 441247377586027 |
10 | 102036650563051 |
11 | 2a56a556175496 |
12 | b53b4779a2437 |
13 | 44c202685b4c9 |
14 | 1b2a8590a4dd1 |
15 | bbe31a1b84a1 |
hex | 5ccd424f95eb |
102036650563051 has 8 divisors (see below), whose sum is σ = 106489608829344. Its totient is φ = 97585074143040.
The previous prime is 102036650563049. The next prime is 102036650563079. The reversal of 102036650563051 is 150365056630201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102036650563051 - 21 = 102036650563049 is a prime.
It is a super-2 number, since 2×1020366505630512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102036650562989 and 102036650563007.
It is not an unprimeable number, because it can be changed into a prime (102036650563091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 345310666 + ... + 345606031.
It is an arithmetic number, because the mean of its divisors is an integer number (13311201103668).
Almost surely, 2102036650563051 is an apocalyptic number.
102036650563051 is a deficient number, since it is larger than the sum of its proper divisors (4452958266293).
102036650563051 is an equidigital number, since it uses as much as digits as its factorization.
102036650563051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 690923141.
The product of its (nonzero) digits is 486000, while the sum is 43.
The spelling of 102036650563051 in words is "one hundred two trillion, thirty-six billion, six hundred fifty million, five hundred sixty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •