Base | Representation |
---|---|
bin | 100001111111101000001… |
… | …1000010010110010100101 |
3 | 121112122120110100202212012 |
4 | 1003333100120102302211 |
5 | 1103022003110330401 |
6 | 13534202251404005 |
7 | 661356424216562 |
oct | 103772030226245 |
9 | 17478513322765 |
10 | 4672125480101 |
11 | 154148a038962 |
12 | 6355a5453605 |
13 | 27b76c340001 |
14 | 1221bc5d9869 |
15 | 817ecd358bb |
hex | 43fd0612ca5 |
4672125480101 has 4 divisors (see below), whose sum is σ = 4672220342892. Its totient is φ = 4672030617312.
The previous prime is 4672125480073. The next prime is 4672125480109. The reversal of 4672125480101 is 1010845212764.
It is a Cunningham number, because it is equal to 21615102+1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3445203727876 + 1226921752225 = 1856126^2 + 1107665^2 .
It is a cyclic number.
It is not a de Polignac number, because 4672125480101 - 26 = 4672125480037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4672125480109) 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, 47357480 + ... + 47456033.
It is an arithmetic number, because the mean of its divisors is an integer number (1168055085723).
Almost surely, 24672125480101 is an apocalyptic number.
It is an amenable number.
4672125480101 is a deficient number, since it is larger than the sum of its proper divisors (94862791).
4672125480101 is an equidigital number, since it uses as much as digits as its factorization.
4672125480101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94862790.
The product of its (nonzero) digits is 107520, while the sum is 41.
The spelling of 4672125480101 in words is "four trillion, six hundred seventy-two billion, one hundred twenty-five million, four hundred eighty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •