Base | Representation |
---|---|
bin | 1001100011101011100000… |
… | …00110010001010111011000 |
3 | 2202102012221201022100012222 |
4 | 10301311300012101113120 |
5 | 10223321113322442022 |
6 | 112411051550123212 |
7 | 4266303465412640 |
oct | 461656006212730 |
9 | 82365851270188 |
10 | 21017155671512 |
11 | 6773364507950 |
12 | 2435322ab0508 |
13 | b95ba88a91a0 |
14 | 529342d07520 |
15 | 266a877c4242 |
hex | 131d701915d8 |
21017155671512 has 64 divisors (see below), whose sum is σ = 52910321990400. Its totient is φ = 7558617421440.
The previous prime is 21017155671509. The next prime is 21017155671553. The reversal of 21017155671512 is 21517655171012.
It is a super-2 number, since 2×210171556715122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1312251962 + ... + 1312267977.
It is an arithmetic number, because the mean of its divisors is an integer number (826723781100).
Almost surely, 221017155671512 is an apocalyptic number.
21017155671512 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21017155671512 is an abundant number, since it is smaller than the sum of its proper divisors (31893166318888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21017155671512 is a wasteful number, since it uses less digits than its factorization.
21017155671512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2624519976 (or 2624519972 counting only the distinct ones).
The product of its (nonzero) digits is 147000, while the sum is 44.
The spelling of 21017155671512 in words is "twenty-one trillion, seventeen billion, one hundred fifty-five million, six hundred seventy-one thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •