Base | Representation |
---|---|
bin | 100110000100001011001… |
… | …0011111110101011100011 |
3 | 200112010210022010002222011 |
4 | 1030020112103332223203 |
5 | 1141203401443042010 |
6 | 15043215002053351 |
7 | 1046655012355516 |
oct | 114102623765343 |
9 | 20463708102864 |
10 | 5231644502755 |
11 | 1737800a29a80 |
12 | 705b171aa257 |
13 | 2bc45a393488 |
14 | 1412da46cd7d |
15 | 91148d5ea8a |
hex | 4c2164feae3 |
5231644502755 has 32 divisors (see below), whose sum is σ = 6994743579648. Its totient is φ = 3723703680000.
The previous prime is 5231644502731. The next prime is 5231644502779. The reversal of 5231644502755 is 5572054461325.
It is an interprime number because it is at equal distance from previous prime (5231644502731) and next prime (5231644502779).
It is not a de Polignac number, because 5231644502755 - 29 = 5231644502243 is a prime.
It is a super-2 number, since 2×52316445027552 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5231644502699 and 5231644502708.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 83337459 + ... + 83400211.
It is an arithmetic number, because the mean of its divisors is an integer number (218585736864).
Almost surely, 25231644502755 is an apocalyptic number.
5231644502755 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5231644502755 is a deficient number, since it is larger than the sum of its proper divisors (1763099076893).
5231644502755 is a wasteful number, since it uses less digits than its factorization.
5231644502755 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95067.
The product of its (nonzero) digits is 5040000, while the sum is 49.
The spelling of 5231644502755 in words is "five trillion, two hundred thirty-one billion, six hundred forty-four million, five hundred two thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •