Base | Representation |
---|---|
bin | 11101010011000010… |
… | …11010111000000111 |
3 | 1111121011220121110120 |
4 | 32221201122320013 |
5 | 224203111342411 |
6 | 11120435153023 |
7 | 1064531253342 |
oct | 165141327007 |
9 | 44534817416 |
10 | 15729012231 |
11 | 6741687769 |
12 | 306b745773 |
13 | 16388a593a |
14 | a92d91459 |
15 | 620d18106 |
hex | 3a985ae07 |
15729012231 has 24 divisors (see below), whose sum is σ = 23096280960. Its totient is φ = 9502179984.
The previous prime is 15729012217. The next prime is 15729012241. The reversal of 15729012231 is 13221092751.
15729012231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 15729012231 - 29 = 15729011719 is a prime.
It is a super-2 number, since 2×157290122312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15729012192 and 15729012201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15729012241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 290821 + ... + 340638.
It is an arithmetic number, because the mean of its divisors is an integer number (962345040).
Almost surely, 215729012231 is an apocalyptic number.
15729012231 is a deficient number, since it is larger than the sum of its proper divisors (7367268729).
15729012231 is a wasteful number, since it uses less digits than its factorization.
15729012231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631523 (or 631504 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 33.
The spelling of 15729012231 in words is "fifteen billion, seven hundred twenty-nine million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •