Base | Representation |
---|---|
bin | 111010100101010011… |
… | …0010011101000111011 |
3 | 110000201121110000202211 |
4 | 1311022212103220323 |
5 | 4030122213414413 |
6 | 133443322435551 |
7 | 12042403006513 |
oct | 1651246235073 |
9 | 400647400684 |
10 | 125805607483 |
11 | 49398a92a36 |
12 | 20470062bb7 |
13 | bb2bc1027a |
14 | 61363d2843 |
15 | 34149e083d |
hex | 1d4a993a3b |
125805607483 has 4 divisors (see below), whose sum is σ = 131275416528. Its totient is φ = 120335798440.
The previous prime is 125805607463. The next prime is 125805607523. The reversal of 125805607483 is 384706508521.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 384706508521 = 1999 ⋅192449479.
It is a cyclic number.
It is not a de Polignac number, because 125805607483 - 221 = 125803510331 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125805607423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2734904488 + ... + 2734904533.
It is an arithmetic number, because the mean of its divisors is an integer number (32818854132).
Almost surely, 2125805607483 is an apocalyptic number.
125805607483 is a deficient number, since it is larger than the sum of its proper divisors (5469809045).
125805607483 is an equidigital number, since it uses as much as digits as its factorization.
125805607483 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5469809044.
The product of its (nonzero) digits is 1612800, while the sum is 49.
The spelling of 125805607483 in words is "one hundred twenty-five billion, eight hundred five million, six hundred seven thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •