Base | Representation |
---|---|
bin | 1111010010000011… |
… | …0111000001000101 |
3 | 101120220010010110211 |
4 | 3310200313001011 |
5 | 31400134122121 |
6 | 1515021315421 |
7 | 203441406061 |
oct | 36440670105 |
9 | 11526103424 |
10 | 4102254661 |
11 | 181568570a |
12 | 965a05b71 |
13 | 504b7452b |
14 | 2acb70aa1 |
15 | 190222ce1 |
hex | f4837045 |
4102254661 has 4 divisors (see below), whose sum is σ = 4148347500. Its totient is φ = 4056161824.
The previous prime is 4102254659. The next prime is 4102254691. The reversal of 4102254661 is 1664522014.
It is a happy number.
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 366722500 + 3735532161 = 19150^2 + 61119^2 .
It is a cyclic number.
It is not a de Polignac number, because 4102254661 - 21 = 4102254659 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 (4102254691) 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, 23046286 + ... + 23046463.
It is an arithmetic number, because the mean of its divisors is an integer number (1037086875).
Almost surely, 24102254661 is an apocalyptic number.
It is an amenable number.
4102254661 is a deficient number, since it is larger than the sum of its proper divisors (46092839).
4102254661 is an equidigital number, since it uses as much as digits as its factorization.
4102254661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46092838.
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 4102254661 is about 64048.8458990480. The cubic root of 4102254661 is about 1600.8139947969.
Adding to 4102254661 its reverse (1664522014), we get a palindrome (5766776675).
The spelling of 4102254661 in words is "four billion, one hundred two million, two hundred fifty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •