Base | Representation |
---|---|
bin | 1001010101000010110101… |
… | …1110000100110000100101 |
3 | 1100022120111001110121000112 |
4 | 2111100231132010300211 |
5 | 2321023113024331011 |
6 | 33452022305422405 |
7 | 2106024415634210 |
oct | 225205536046045 |
9 | 40276431417015 |
10 | 10257144761381 |
11 | 32a50378a6241 |
12 | 1197aa103aa05 |
13 | 59532450696b |
14 | 27663c7c0777 |
15 | 12bc2a11d58b |
hex | 9542d784c25 |
10257144761381 has 16 divisors (see below), whose sum is σ = 11914777310208. Its totient is φ = 8647597497600.
The previous prime is 10257144761363. The next prime is 10257144761441. The reversal of 10257144761381 is 18316744175201.
It is a cyclic number.
It is not a de Polignac number, because 10257144761381 - 26 = 10257144761317 is a prime.
It is a super-2 number, since 2×102571447613812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10257144701381) 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 15 ways as a sum of consecutive naturals, for example, 58716236 + ... + 58890666.
It is an arithmetic number, because the mean of its divisors is an integer number (744673581888).
Almost surely, 210257144761381 is an apocalyptic number.
It is an amenable number.
10257144761381 is a deficient number, since it is larger than the sum of its proper divisors (1657632548827).
10257144761381 is a wasteful number, since it uses less digits than its factorization.
10257144761381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312212.
The product of its (nonzero) digits is 1128960, while the sum is 50.
The spelling of 10257144761381 in words is "ten trillion, two hundred fifty-seven billion, one hundred forty-four million, seven hundred sixty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •