Base | Representation |
---|---|
bin | 110110000111011101011101… |
… | …1111001010000010011100100 |
3 | 2022102102112022102201112021221 |
4 | 1230032322323321100103210 |
5 | 444343004421201422233 |
6 | 4404221553010550124 |
7 | 202156622014036213 |
oct | 15416727371202344 |
9 | 2272375272645257 |
10 | 476014377764068 |
11 | 128744622640110 |
12 | 4547a937b98344 |
13 | 1757bc6a24a940 |
14 | 857930c5cd07a |
15 | 3a0735de6042d |
hex | 1b0eebbe504e4 |
476014377764068 has 144 divisors (see below), whose sum is σ = 1035575243974656. Its totient is φ = 188720337438720.
The previous prime is 476014377764063. The next prime is 476014377764069. The reversal of 476014377764068 is 860467773410674.
It is a super-2 number, since 2×4760143777640682 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 476014377763988 and 476014377764006.
It is not an unprimeable number, because it can be changed into a prime (476014377764063) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 76076980 + ... + 82095892.
It is an arithmetic number, because the mean of its divisors is an integer number (7191494749824).
Almost surely, 2476014377764068 is an apocalyptic number.
It is an amenable number.
476014377764068 is an abundant number, since it is smaller than the sum of its proper divisors (559560866210588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
476014377764068 is a wasteful number, since it uses less digits than its factorization.
476014377764068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6019362 (or 6019341 counting only the distinct ones).
The product of its (nonzero) digits is 796594176, while the sum is 70.
The spelling of 476014377764068 in words is "four hundred seventy-six trillion, fourteen billion, three hundred seventy-seven million, seven hundred sixty-four thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •