Base | Representation |
---|---|
bin | 111010011010000001101… |
… | …000011011101001100110 |
3 | 112012200222212022211202220 |
4 | 322122001220123221212 |
5 | 1011230001111024332 |
6 | 12311505002013210 |
7 | 562656406522560 |
oct | 72320150335146 |
9 | 15180885284686 |
10 | 4013674314342 |
11 | 130820a572400 |
12 | 549a634a7206 |
13 | 231645ab54b4 |
14 | dc397478330 |
15 | 6e611708d2c |
hex | 3a681a1ba66 |
4013674314342 has 96 divisors (see below), whose sum is σ = 10126137369600. Its totient is φ = 1038150516480.
The previous prime is 4013674314329. The next prime is 4013674314361. The reversal of 4013674314342 is 2434134763104.
It is a super-2 number, since 2×40136743143422 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 4013674314294 and 4013674314303.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 437667 + ... + 2866862.
It is an arithmetic number, because the mean of its divisors is an integer number (105480597600).
Almost surely, 24013674314342 is an apocalyptic number.
4013674314342 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
4013674314342 is an abundant number, since it is smaller than the sum of its proper divisors (6112463055258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4013674314342 is a wasteful number, since it uses less digits than its factorization.
4013674314342 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3304802 (or 3304791 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 42.
The spelling of 4013674314342 in words is "four trillion, thirteen billion, six hundred seventy-four million, three hundred fourteen thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •