Base | Representation |
---|---|
bin | 101000111011100010000… |
… | …0111111101101110100010 |
3 | 201220210010222110121102200 |
4 | 1101313010013331232202 |
5 | 1214131311032101032 |
6 | 15544135124554030 |
7 | 1120264502154261 |
oct | 121670407755642 |
9 | 21823128417380 |
10 | 5625402612642 |
11 | 18797a11369aa |
12 | 76a2a7b52916 |
13 | 31a61c7a27c7 |
14 | 1563b16585d8 |
15 | 9b4e278e47c |
hex | 51dc41fdba2 |
5625402612642 has 54 divisors (see below), whose sum is σ = 12864065623227. Its totient is φ = 1776382554312.
The previous prime is 5625402612589. The next prime is 5625402612649. The reversal of 5625402612642 is 2462162045265.
5625402612642 is a `hidden beast` number, since 5 + 6 + 2 + 540 + 2 + 61 + 2 + 6 + 42 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2812701306321 + 2812701306321 = 1677111^2 + 1677111^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=1677111.
It is not an unprimeable number, because it can be changed into a prime (5625402612649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 191175943 + ... + 191205365.
Almost surely, 25625402612642 is an apocalyptic number.
5625402612642 is an abundant number, since it is smaller than the sum of its proper divisors (7238663010585).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5625402612642 is an frugal number, since it uses more digits than its factorization.
5625402612642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58892 (or 29447 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 45.
The spelling of 5625402612642 in words is "five trillion, six hundred twenty-five billion, four hundred two million, six hundred twelve thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •