Base | Representation |
---|---|
bin | 11100000100000011… |
… | …10000101010010111 |
3 | 1102220000002111022211 |
4 | 32002001300222113 |
5 | 221323444321211 |
6 | 10531005134251 |
7 | 1042234204414 |
oct | 160201605227 |
9 | 42800074284 |
10 | 15066401431 |
11 | 6431655434 |
12 | 2b0585a387 |
13 | 1561527943 |
14 | a2cd8b10b |
15 | 5d2a7de21 |
hex | 382070a97 |
15066401431 has 4 divisors (see below), whose sum is σ = 15066651600. Its totient is φ = 15066151264.
The previous prime is 15066401393. The next prime is 15066401437. The reversal of 15066401431 is 13410466051.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 15066401431 - 215 = 15066368663 is a prime.
It is a super-2 number, since 2×150664014312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15066401393 and 15066401402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15066401437) 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, 26430 + ... + 175588.
It is an arithmetic number, because the mean of its divisors is an integer number (3766662900).
Almost surely, 215066401431 is an apocalyptic number.
15066401431 is a deficient number, since it is larger than the sum of its proper divisors (250169).
15066401431 is a wasteful number, since it uses less digits than its factorization.
15066401431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250168.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 15066401431 its reverse (13410466051), we get a palindrome (28476867482).
The spelling of 15066401431 in words is "fifteen billion, sixty-six million, four hundred one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •