Base | Representation |
---|---|
bin | 101000111011011100101… |
… | …1000011110000110000111 |
3 | 201220202200102100100122121 |
4 | 1101312321120132012013 |
5 | 1214130423412441101 |
6 | 15544105210110411 |
7 | 1120260153251260 |
oct | 121667130360607 |
9 | 21822612310577 |
10 | 5625222390151 |
11 | 18797094320a1 |
12 | 76a25771b407 |
13 | 31a5c1351590 |
14 | 156395743967 |
15 | 9b4d1a400a1 |
hex | 51db961e187 |
5625222390151 has 8 divisors (see below), whose sum is σ = 6923350634144. Its totient is φ = 4450725407520.
The previous prime is 5625222390103. The next prime is 5625222390187. The reversal of 5625222390151 is 1510932225265.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5625222390151 is a prime.
It is a super-2 number, since 2×56252223901512 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5625222390098 and 5625222390107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5625222390101) 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, 30907815240 + ... + 30907815421.
It is an arithmetic number, because the mean of its divisors is an integer number (865418829268).
Almost surely, 25625222390151 is an apocalyptic number.
5625222390151 is a deficient number, since it is larger than the sum of its proper divisors (1298128243993).
5625222390151 is a wasteful number, since it uses less digits than its factorization.
5625222390151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61815630681.
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 5625222390151 in words is "five trillion, six hundred twenty-five billion, two hundred twenty-two million, three hundred ninety thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •