Base | Representation |
---|---|
bin | 101001000110111111100… |
… | …1001010111011101010011 |
3 | 202000010200021022100201111 |
4 | 1102031333021113131103 |
5 | 1220032212334443201 |
6 | 20003325305114151 |
7 | 1122125433265510 |
oct | 122157711273523 |
9 | 22003607270644 |
10 | 5650015156051 |
11 | 1889181295072 |
12 | 773016788957 |
13 | 31ca42969b66 |
14 | 157668384307 |
15 | 9be83429b51 |
hex | 5237f257753 |
5650015156051 has 16 divisors (see below), whose sum is σ = 6665861283840. Its totient is φ = 4686363318240.
The previous prime is 5650015156007. The next prime is 5650015156057. The reversal of 5650015156051 is 1506515100565.
It is a cyclic number.
It is not a de Polignac number, because 5650015156051 - 29 = 5650015155539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5650015155995 and 5650015156013.
It is not an unprimeable number, because it can be changed into a prime (5650015156057) 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, 2819805 + ... + 4387633.
It is an arithmetic number, because the mean of its divisors is an integer number (416616330240).
Almost surely, 25650015156051 is an apocalyptic number.
5650015156051 is a deficient number, since it is larger than the sum of its proper divisors (1015846127789).
5650015156051 is a wasteful number, since it uses less digits than its factorization.
5650015156051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1584474.
The product of its (nonzero) digits is 112500, while the sum is 40.
The spelling of 5650015156051 in words is "five trillion, six hundred fifty billion, fifteen million, one hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •