Base | Representation |
---|---|
bin | 1001110010011001… |
… | …01011000100010101 |
3 | 111120012102212101220 |
4 | 10321030223010111 |
5 | 41230133400431 |
6 | 2225224040553 |
7 | 244133166351 |
oct | 47114530425 |
9 | 14505385356 |
10 | 5254590741 |
11 | 2257096884 |
12 | 1027903159 |
13 | 65981a9ba |
14 | 37bc14461 |
15 | 20b495b96 |
hex | 13932b115 |
5254590741 has 32 divisors (see below), whose sum is σ = 7905558528. Its totient is φ = 3086519040.
The previous prime is 5254590703. The next prime is 5254590793. The reversal of 5254590741 is 1470954525.
It is not a de Polignac number, because 5254590741 - 219 = 5254066453 is a prime.
It is a super-2 number, since 2×52545907412 = 55221447710805858162, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5254590693 and 5254590702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5254590541) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7476 + ... + 102786.
It is an arithmetic number, because the mean of its divisors is an integer number (247048704).
Almost surely, 25254590741 is an apocalyptic number.
5254590741 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5254590741 is a deficient number, since it is larger than the sum of its proper divisors (2650967787).
5254590741 is a wasteful number, since it uses less digits than its factorization.
5254590741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95401.
The product of its (nonzero) digits is 252000, while the sum is 42.
The square root of 5254590741 is about 72488.5559312641. Note that the first 3 decimals coincide. The cubic root of 5254590741 is about 1738.5197633658.
The spelling of 5254590741 in words is "five billion, two hundred fifty-four million, five hundred ninety thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •