Base | Representation |
---|---|
bin | 11100000111010011… |
… | …01111111000111011 |
3 | 1102221220101102202111 |
4 | 32003221233320323 |
5 | 221402434124433 |
6 | 10533421313151 |
7 | 1043015001163 |
oct | 160351577073 |
9 | 42856342674 |
10 | 15093661243 |
11 | 6445a84101 |
12 | 2b12a057b7 |
13 | 15670805cb |
14 | a328455a3 |
15 | 5d5165dcd |
hex | 383a6fe3b |
15093661243 has 4 divisors (see below), whose sum is σ = 15749907408. Its totient is φ = 14437415080.
The previous prime is 15093661241. The next prime is 15093661277. The reversal of 15093661243 is 34216639051.
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 15093661243 - 21 = 15093661241 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15093661196 and 15093661205.
It is not an unprimeable number, because it can be changed into a prime (15093661241) 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, 328123048 + ... + 328123093.
It is an arithmetic number, because the mean of its divisors is an integer number (3937476852).
Almost surely, 215093661243 is an apocalyptic number.
15093661243 is a deficient number, since it is larger than the sum of its proper divisors (656246165).
15093661243 is an equidigital number, since it uses as much as digits as its factorization.
15093661243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 656246164.
The product of its (nonzero) digits is 116640, while the sum is 40.
The spelling of 15093661243 in words is "fifteen billion, ninety-three million, six hundred sixty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •