Base | Representation |
---|---|
bin | 110010101111000001110… |
… | …1000000110001111111001 |
3 | 220200121101012021011002100 |
4 | 1211132003220012033321 |
5 | 1403221040200414212 |
6 | 22455154033054013 |
7 | 1316530650112140 |
oct | 145360350061771 |
9 | 26617335234070 |
10 | 6972940248057 |
11 | 2249230a93193 |
12 | 94749b6b7309 |
13 | 3b77124569a4 |
14 | 1a16c64bc757 |
15 | c15aecb4bdc |
hex | 65783a063f9 |
6972940248057 has 24 divisors (see below), whose sum is σ = 11624854662720. Its totient is φ = 3945086416800.
The previous prime is 6972940248011. The next prime is 6972940248061. The reversal of 6972940248057 is 7508420492796.
6972940248057 is a `hidden beast` number, since 6 + 97 + 29 + 40 + 2 + 480 + 5 + 7 = 666.
It is not a de Polignac number, because 6972940248057 - 211 = 6972940246009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 6972940247985 and 6972940248003.
It is not an unprimeable number, because it can be changed into a prime (6972940248007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 547922307 + ... + 547935032.
It is an arithmetic number, because the mean of its divisors is an integer number (484368944280).
Almost surely, 26972940248057 is an apocalyptic number.
It is an amenable number.
6972940248057 is a deficient number, since it is larger than the sum of its proper divisors (4651914414663).
6972940248057 is a wasteful number, since it uses less digits than its factorization.
6972940248057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1095857453 (or 1095857450 counting only the distinct ones).
The product of its (nonzero) digits is 60963840, while the sum is 63.
The spelling of 6972940248057 in words is "six trillion, nine hundred seventy-two billion, nine hundred forty million, two hundred forty-eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •