Search a number
-
+
70120151101257 = 3792208611339601
BaseRepresentation
bin11111111000110000111101…
…01100101010111101001001
3100012021102100220010010020220
433330120132230222331021
533142322032140220012
6405044430330340253
720525004466112625
oct1774303654527511
9305242326103226
1070120151101257
11203848752a4914
127a4590888a689
1330183c02b72aa
141345b94ca2185
15818ebcd9708c
hex3fc61eb2af49

70120151101257 has 16 divisors (see below), whose sum is σ = 94677496615680. Its totient is φ = 46154792736000.

The previous prime is 70120151101181. The next prime is 70120151101279. The reversal of 70120151101257 is 75210115102107.

It is not a de Polignac number, because 70120151101257 - 28 = 70120151101001 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51674257 + ... + 53013857.

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

Almost surely, 270120151101257 is an apocalyptic number.

It is an amenable number.

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

70120151101257 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1560544.

The product of its (nonzero) digits is 4900, while the sum is 33.

The spelling of 70120151101257 in words is "seventy trillion, one hundred twenty billion, one hundred fifty-one million, one hundred one thousand, two hundred fifty-seven".

Divisors: 1 3 79 237 220861 662583 1339601 4018803 17448019 52344057 105828479 317485437 295865616461 887596849383 23373383700419 70120151101257