Base | Representation |
---|---|
bin | 101101011111010110011100… |
… | …1101000011100100111100101 |
3 | 1221110202100020002211100002201 |
4 | 1122332230321220130213211 |
5 | 404421234343301222131 |
6 | 3535002322003534501 |
7 | 150165440610430555 |
oct | 13276547150344745 |
9 | 1843670202740081 |
10 | 400133005101541 |
11 | 1065494aaa30018 |
12 | 38a6455998a431 |
13 | 142364c3ba1b7a |
14 | 70b477dc87165 |
15 | 313d59ebe2761 |
hex | 16beb39a1c9e5 |
400133005101541 has 16 divisors (see below), whose sum is σ = 407001681429568. Its totient is φ = 393274395158400.
The previous prime is 400133005101527. The next prime is 400133005101623. The reversal of 400133005101541 is 145101500331004.
It is a cyclic number.
It is not a de Polignac number, because 400133005101541 - 27 = 400133005101413 is a prime.
It is a super-3 number, since 3×4001330051015413 (a number of 45 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400133005191541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 510163561 + ... + 510947281.
It is an arithmetic number, because the mean of its divisors is an integer number (25437605089348).
Almost surely, 2400133005101541 is an apocalyptic number.
It is an amenable number.
400133005101541 is a deficient number, since it is larger than the sum of its proper divisors (6868676328027).
400133005101541 is a wasteful number, since it uses less digits than its factorization.
400133005101541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 790132.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 400133005101541 its reverse (145101500331004), we get a palindrome (545234505432545).
The spelling of 400133005101541 in words is "four hundred trillion, one hundred thirty-three billion, five million, one hundred one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •