Base | Representation |
---|---|
bin | 11101111100110101111… |
… | …11000010010010000111 |
3 | 10122101021120022110122110 |
4 | 32332122333002102013 |
5 | 113330042413240211 |
6 | 2104432200432103 |
7 | 134230664365233 |
oct | 16763277022207 |
9 | 3571246273573 |
10 | 1029097399431 |
11 | 36748a720842 |
12 | 147542778633 |
13 | 7607466665a |
14 | 37b46a595c3 |
15 | 1bb80eecea6 |
hex | ef9afc2487 |
1029097399431 has 16 divisors (see below), whose sum is σ = 1476660496608. Its totient is φ = 635122790400.
The previous prime is 1029097399391. The next prime is 1029097399433. The reversal of 1029097399431 is 1349937909201.
It is not a de Polignac number, because 1029097399431 - 213 = 1029097391239 is a prime.
It is a super-2 number, since 2×10290973994312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1029097399433) 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 15 ways as a sum of consecutive naturals, for example, 165393450 + ... + 165399671.
It is an arithmetic number, because the mean of its divisors is an integer number (92291281038).
Almost surely, 21029097399431 is an apocalyptic number.
1029097399431 is a deficient number, since it is larger than the sum of its proper divisors (447563097177).
1029097399431 is a wasteful number, since it uses less digits than its factorization.
1029097399431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330793202.
The product of its (nonzero) digits is 3306744, while the sum is 57.
The spelling of 1029097399431 in words is "one trillion, twenty-nine billion, ninety-seven million, three hundred ninety-nine thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •