Base | Representation |
---|---|
bin | 1001100000000001… |
… | …01011000011101111 |
3 | 111011110101201002201 |
4 | 10300000223003233 |
5 | 40421203400111 |
6 | 2202040202331 |
7 | 240252052465 |
oct | 46000530357 |
9 | 14143351081 |
10 | 5100450031 |
11 | 2188086666 |
12 | ba41693a7 |
13 | 6338cc191 |
14 | 36556c835 |
15 | 1ecb996c1 |
hex | 13002b0ef |
5100450031 has 8 divisors (see below), whose sum is σ = 5445982080. Its totient is φ = 4765232472.
The previous prime is 5100450001. The next prime is 5100450049. The reversal of 5100450031 is 1300540015.
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 5100450031 - 211 = 5100447983 is a prime.
It is a super-2 number, since 2×51004500312 = 52029181037455801922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5100449990 and 5100450008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5100450001) 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, 2577601 + ... + 2579578.
It is an arithmetic number, because the mean of its divisors is an integer number (680747760).
Almost surely, 25100450031 is an apocalyptic number.
5100450031 is a deficient number, since it is larger than the sum of its proper divisors (345532049).
5100450031 is a wasteful number, since it uses less digits than its factorization.
5100450031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5157245.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 5100450031 is about 71417.4350631553. The cubic root of 5100450031 is about 1721.3512492136.
Adding to 5100450031 its reverse (1300540015), we get a palindrome (6400990046).
The spelling of 5100450031 in words is "five billion, one hundred million, four hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •