Base | Representation |
---|---|
bin | 1000101101100001101010111… |
… | …0001110000100011101010001 |
3 | 2222101110211201202120022220102 |
4 | 2023120122232032010131101 |
5 | 1120321444124323302003 |
6 | 10011431133011422145 |
7 | 243056152450401335 |
oct | 21330325616043521 |
9 | 2871424652508812 |
10 | 613006425212753 |
11 | 168360623a96120 |
12 | 589049035b4955 |
13 | 2040834768c380 |
14 | ab5395274b7c5 |
15 | 4ad0a85981588 |
hex | 22d86ae384751 |
613006425212753 has 32 divisors (see below), whose sum is σ = 722775111018240. Its totient is φ = 512556856162560.
The previous prime is 613006425212723. The next prime is 613006425212803. The reversal of 613006425212753 is 357212524600316.
It is a happy number.
It is not a de Polignac number, because 613006425212753 - 210 = 613006425211729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 613006425212698 and 613006425212707.
It is not an unprimeable number, because it can be changed into a prime (613006425212723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46297751 + ... + 58047347.
It is an arithmetic number, because the mean of its divisors is an integer number (22586722219320).
Almost surely, 2613006425212753 is an apocalyptic number.
It is an amenable number.
613006425212753 is a deficient number, since it is larger than the sum of its proper divisors (109768685805487).
613006425212753 is a wasteful number, since it uses less digits than its factorization.
613006425212753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11750937.
The product of its (nonzero) digits is 1814400, while the sum is 47.
The spelling of 613006425212753 in words is "six hundred thirteen trillion, six billion, four hundred twenty-five million, two hundred twelve thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •