Base | Representation |
---|---|
bin | 11111010100110100011… |
… | …11000111000100010000 |
3 | 10210220012020210120122022 |
4 | 33222122033013010100 |
5 | 120113310321220433 |
6 | 2142243044031012 |
7 | 140522306411366 |
oct | 17523217070420 |
9 | 3726166716568 |
10 | 1076329476368 |
11 | 385517a25273 |
12 | 154724692468 |
13 | 7a660b2a583 |
14 | 3a147915636 |
15 | 1cee7892698 |
hex | fa9a3c7110 |
1076329476368 has 80 divisors (see below), whose sum is σ = 2156984860800. Its totient is φ = 519948149760.
The previous prime is 1076329476349. The next prime is 1076329476373. The reversal of 1076329476368 is 8636749236701.
It is a Cunningham number, because it is equal to 10374632-1.
It is a super-2 number, since 2×10763294763682 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1076329476368.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 226164773 + ... + 226169531.
It is an arithmetic number, because the mean of its divisors is an integer number (26962310760).
Almost surely, 21076329476368 is an apocalyptic number.
It is an amenable number.
1076329476368 is an abundant number, since it is smaller than the sum of its proper divisors (1080655384432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1076329476368 is a wasteful number, since it uses less digits than its factorization.
1076329476368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8080 (or 8074 counting only the distinct ones).
The product of its (nonzero) digits is 54867456, while the sum is 62.
The spelling of 1076329476368 in words is "one trillion, seventy-six billion, three hundred twenty-nine million, four hundred seventy-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •