Base | Representation |
---|---|
bin | 110011001110010100… |
… | …001010101010100101 |
3 | 12020222010002022202210 |
4 | 303032110022222211 |
5 | 1400120224004423 |
6 | 41133410154033 |
7 | 3654655535316 |
oct | 631624125245 |
9 | 166863068683 |
10 | 55001000613 |
11 | 213646a3909 |
12 | a7ab882919 |
13 | 5256b8bba0 |
14 | 293a9b260d |
15 | 166d947b93 |
hex | cce50aaa5 |
55001000613 has 16 divisors (see below), whose sum is σ = 79260922496. Its totient is φ = 33724572480.
The previous prime is 55001000611. The next prime is 55001000617. The reversal of 55001000613 is 31600010055.
It is a happy number.
It is not a de Polignac number, because 55001000613 - 21 = 55001000611 is a prime.
It is a super-2 number, since 2×550010006132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 55001000613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55001000611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2534833 + ... + 2556438.
It is an arithmetic number, because the mean of its divisors is an integer number (4953807656).
Almost surely, 255001000613 is an apocalyptic number.
It is an amenable number.
55001000613 is a deficient number, since it is larger than the sum of its proper divisors (24259921883).
55001000613 is a wasteful number, since it uses less digits than its factorization.
55001000613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5091564.
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 55001000613 its reverse (31600010055), we get a palindrome (86601010668).
The spelling of 55001000613 in words is "fifty-five billion, one million, six hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •