Base | Representation |
---|---|
bin | 1001001110010011000110… |
… | …1010100000111101110111 |
3 | 1022220111100012221020212122 |
4 | 2103210301222200331313 |
5 | 2312123240224431034 |
6 | 33322454300310155 |
7 | 2064452440223252 |
oct | 223446152407567 |
9 | 38814305836778 |
10 | 10141251014519 |
11 | 325a9758a7959 |
12 | 117953854235b |
13 | 587414c63aa1 |
14 | 270ba696a099 |
15 | 128be58ca62e |
hex | 93931aa0f77 |
10141251014519 has 4 divisors (see below), whose sum is σ = 10582174971696. Its totient is φ = 9700327057344.
The previous prime is 10141251014513. The next prime is 10141251014527. The reversal of 10141251014519 is 91541015214101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10141251014519 - 232 = 10136956047223 is a prime.
It is a super-2 number, since 2×101412510145192 (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 (10141251014513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220461978554 + ... + 220461978599.
It is an arithmetic number, because the mean of its divisors is an integer number (2645543742924).
Almost surely, 210141251014519 is an apocalyptic number.
10141251014519 is a deficient number, since it is larger than the sum of its proper divisors (440923957177).
10141251014519 is an equidigital number, since it uses as much as digits as its factorization.
10141251014519 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440923957176.
The product of its (nonzero) digits is 7200, while the sum is 35.
The spelling of 10141251014519 in words is "ten trillion, one hundred forty-one billion, two hundred fifty-one million, fourteen thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •