Search a number
-
+
2630254354153 = 4755962858599
BaseRepresentation
bin100110010001100111011…
…000000101111011101001
3100022110010221121100010121
4212101213120011323221
5321043230103313103
65332153331043241
7361013104060156
oct46214730057351
910273127540117
102630254354153
11924537015458
12365916a40521
1316105519218a
149143ac6d22d
1548643e686bd
hex26467605ee9

2630254354153 has 4 divisors (see below), whose sum is σ = 2686217212800. Its totient is φ = 2574291495508.

The previous prime is 2630254354141. The next prime is 2630254354177. The reversal of 2630254354153 is 3514534520362.

2630254354153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 2630254354153 - 29 = 2630254353641 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (2630254354183) 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, 27981429253 + ... + 27981429346.

It is an arithmetic number, because the mean of its divisors is an integer number (671554303200).

Almost surely, 22630254354153 is an apocalyptic number.

It is an amenable number.

2630254354153 is a deficient number, since it is larger than the sum of its proper divisors (55962858647).

2630254354153 is an equidigital number, since it uses as much as digits as its factorization.

2630254354153 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 55962858646.

The product of its (nonzero) digits is 1296000, while the sum is 43.

The spelling of 2630254354153 in words is "two trillion, six hundred thirty billion, two hundred fifty-four million, three hundred fifty-four thousand, one hundred fifty-three".

Divisors: 1 47 55962858599 2630254354153