Base | Representation |
---|---|
bin | 10101001110010001011110… |
… | …10001001100111000000000 |
3 | 20010020121012002221112210000 |
4 | 22213020233101030320000 |
5 | 22104114432331123142 |
6 | 243131505401440000 |
7 | 12554534550622320 |
oct | 1247105721147000 |
9 | 203217162845700 |
10 | 46669907676672 |
11 | 13963662224215 |
12 | 5298b357a0000 |
13 | 2006c51845ac7 |
14 | b74b9abb1280 |
15 | 55ded0e9814c |
hex | 2a722f44ce00 |
46669907676672 has 200 divisors, whose sum is σ = 159197013279216. Its totient is φ = 13334259253248.
The previous prime is 46669907676577. The next prime is 46669907676683. The reversal of 46669907676672 is 27667670996664.
It is a Harshad number since it is a multiple of its sum of digits (81).
It is a junction number, because it is equal to n+sod(n) for n = 46669907676591 and 46669907676600.
It is a congruent number.
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 19 ways as a sum of consecutive naturals, for example, 80090793 + ... + 80671400.
Almost surely, 246669907676672 is an apocalyptic number.
46669907676672 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
46669907676672 is an abundant number, since it is smaller than the sum of its proper divisors (112527105602544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46669907676672 is an equidigital number, since it uses as much as digits as its factorization.
46669907676672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160762230 (or 160762205 counting only the distinct ones).
The product of its (nonzero) digits is 10369949184, while the sum is 81.
The spelling of 46669907676672 in words is "forty-six trillion, six hundred sixty-nine billion, nine hundred seven million, six hundred seventy-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.496 sec. • engine limits •