Base | Representation |
---|---|
bin | 1000010100100111101011… |
… | …1011011111110100111101 |
3 | 1012101202122010020020101021 |
4 | 2011021322323133310331 |
5 | 2144404400221221233 |
6 | 31243335345344141 |
7 | 1633043011061134 |
oct | 205117273376475 |
9 | 35352563206337 |
10 | 9150342757693 |
11 | 2a08702a351a5 |
12 | 1039493338051 |
13 | 514b4845aa47 |
14 | 238c43bba91b |
15 | 10d04c413e2d |
hex | 8527aedfd3d |
9150342757693 has 4 divisors (see below), whose sum is σ = 9631939744960. Its totient is φ = 8668745770428.
The previous prime is 9150342757607. The next prime is 9150342757723. The reversal of 9150342757693 is 3967572430519.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9150342757693 is a prime.
It is a super-2 number, since 2×91503427576932 (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 (9150342757393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 240798493605 + ... + 240798493642.
It is an arithmetic number, because the mean of its divisors is an integer number (2407984936240).
Almost surely, 29150342757693 is an apocalyptic number.
It is an amenable number.
9150342757693 is a deficient number, since it is larger than the sum of its proper divisors (481596987267).
9150342757693 is a wasteful number, since it uses less digits than its factorization.
9150342757693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481596987266.
The product of its (nonzero) digits is 42865200, while the sum is 61.
The spelling of 9150342757693 in words is "nine trillion, one hundred fifty billion, three hundred forty-two million, seven hundred fifty-seven thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •