Base | Representation |
---|---|
bin | 10111010011001010100… |
… | …101000100101110100000 |
3 | 12200001210021002011122100 |
4 | 113103022211010232200 |
5 | 202213101344103212 |
6 | 3223314122410400 |
7 | 223451260060443 |
oct | 27231245045640 |
9 | 5601707064570 |
10 | 1601126550432 |
11 | 568041218502 |
12 | 21a386060a00 |
13 | b7ca7441826 |
14 | 576d017b65a |
15 | 2b9b0461bdc |
hex | 174ca944ba0 |
1601126550432 has 72 divisors (see below), whose sum is σ = 4554039445956. Its totient is φ = 533610878976.
The previous prime is 1601126550407. The next prime is 1601126550449. The reversal of 1601126550432 is 2340556211061.
1601126550432 is a `hidden beast` number, since 1 + 6 + 0 + 112 + 6 + 5 + 504 + 32 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1583882658576 + 17243891856 = 1258524^2 + 131316^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1069848 + ... + 2084904.
Almost surely, 21601126550432 is an apocalyptic number.
1601126550432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1601126550432 is an abundant number, since it is smaller than the sum of its proper divisors (2952912895524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1601126550432 is a wasteful number, since it uses less digits than its factorization.
1601126550432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1020550 (or 1020539 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 1601126550432 in words is "one trillion, six hundred one billion, one hundred twenty-six million, five hundred fifty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •