Base | Representation |
---|---|
bin | 1011101011010111111… |
… | …01011101100001010101 |
3 | 1102100200022221010011002 |
4 | 11311223331131201111 |
5 | 23033221231413331 |
6 | 504154550553045 |
7 | 40663116126050 |
oct | 5655375354125 |
9 | 1370608833132 |
10 | 401243232341 |
11 | 145191387246 |
12 | 6591b668785 |
13 | 2bab608b693 |
14 | 155c5347a97 |
15 | a685b239cb |
hex | 5d6bf5d855 |
401243232341 has 32 divisors (see below), whose sum is σ = 486088404480. Its totient is φ = 323869593600.
The previous prime is 401243232331. The next prime is 401243232373. The reversal of 401243232341 is 143232342104.
It is not a de Polignac number, because 401243232341 - 26 = 401243232277 is a prime.
It is a super-2 number, since 2×4012432323412 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401243232331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48743696 + ... + 48751926.
It is an arithmetic number, because the mean of its divisors is an integer number (15190262640).
Almost surely, 2401243232341 is an apocalyptic number.
401243232341 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
401243232341 is a deficient number, since it is larger than the sum of its proper divisors (84845172139).
401243232341 is a wasteful number, since it uses less digits than its factorization.
401243232341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14165.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 401243232341 its reverse (143232342104), we get a palindrome (544475574445).
The spelling of 401243232341 in words is "four hundred one billion, two hundred forty-three million, two hundred thirty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •