Search a number
-
+
3051405051401 = 7450796719549
BaseRepresentation
bin101100011001110101111…
…010100000011000001001
3101210201012122221110020202
4230121311322200120021
5344443234143121101
610253443544101545
7433312442661440
oct54316572403011
911721178843222
103051405051401
11a77103668733
124134714648b5
131919916c9695
14a7990091d57
155459262a36b
hex2c675ea0609

3051405051401 has 8 divisors (see below), whose sum is σ = 3488093851200. Its totient is φ = 2614909699728.

The previous prime is 3051405051377. The next prime is 3051405051419. The reversal of 3051405051401 is 1041505041503.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 3051405051401 - 26 = 3051405051337 is a prime.

It is a super-2 number, since 2×30514050514012 (a number of 26 digits) contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (3051405051421) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48328226 + ... + 48391323.

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

Almost surely, 23051405051401 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 96724063.

The product of its (nonzero) digits is 6000, while the sum is 29.

The spelling of 3051405051401 in words is "three trillion, fifty-one billion, four hundred five million, fifty-one thousand, four hundred one".

Divisors: 1 7 4507 31549 96719549 677036843 435915007343 3051405051401