Base | Representation |
---|---|
bin | 1001100000100100… |
… | …00100011100010100 |
3 | 111011202222101211012 |
4 | 10300102010130110 |
5 | 40423340313302 |
6 | 2202322031352 |
7 | 240335605253 |
oct | 46022043424 |
9 | 14152871735 |
10 | 5105010452 |
11 | 218a710a03 |
12 | ba57a8558 |
13 | 634837b59 |
14 | 365dd879a |
15 | 1ed29aa52 |
hex | 130484714 |
5105010452 has 12 divisors (see below), whose sum is σ = 9034148340. Its totient is φ = 2523825216.
The previous prime is 5105010431. The next prime is 5105010479. The reversal of 5105010452 is 2540105015.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2707537156 + 2397473296 = 52034^2 + 48964^2 .
It is a super-2 number, since 2×51050104522 = 52122263430058488608, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7169603 + ... + 7170314.
It is an arithmetic number, because the mean of its divisors is an integer number (752845695).
Almost surely, 25105010452 is an apocalyptic number.
It is an amenable number.
5105010452 is a deficient number, since it is larger than the sum of its proper divisors (3929137888).
5105010452 is a wasteful number, since it uses less digits than its factorization.
5105010452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14340010 (or 14340008 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 23.
The square root of 5105010452 is about 71449.3558543392. The cubic root of 5105010452 is about 1721.8641286560.
Adding to 5105010452 its reverse (2540105015), we get a palindrome (7645115467).
The spelling of 5105010452 in words is "five billion, one hundred five million, ten thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •