Base | Representation |
---|---|
bin | 10010110110111100100001… |
… | …00010111111010010100010 |
3 | 12102211112011220101011211220 |
4 | 21123132100202333102202 |
5 | 20413422221042142424 |
6 | 224111113015515510 |
7 | 11510063354502330 |
oct | 1133362042772242 |
9 | 172745156334756 |
10 | 41470334334114 |
11 | 12239519669614 |
12 | 479928b088b96 |
13 | 1a1a8359786ca |
14 | a35263c8ab50 |
15 | 4bdb129ce579 |
hex | 25b7908bf4a2 |
41470334334114 has 64 divisors (see below), whose sum is σ = 96906322446336. Its totient is φ = 11586625294464.
The previous prime is 41470334334113. The next prime is 41470334334151. The reversal of 41470334334114 is 41143343307414.
41470334334114 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (41470334334113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 53399694 + ... + 54170729.
It is an arithmetic number, because the mean of its divisors is an integer number (1514161288224).
Almost surely, 241470334334114 is an apocalyptic number.
41470334334114 is an abundant number, since it is smaller than the sum of its proper divisors (55435988112222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41470334334114 is a wasteful number, since it uses less digits than its factorization.
41470334334114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107570639.
The product of its (nonzero) digits is 580608, while the sum is 42.
The spelling of 41470334334114 in words is "forty-one trillion, four hundred seventy billion, three hundred thirty-four million, three hundred thirty-four thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •